Title of article
Decomposition basedheuristicalgorithmforlot-sizingandschedulingproblem treating timehorizonasacontinuum
Author/Authors
Seong-in Kim، نويسنده , , JungheeHanc، نويسنده , , YounghoLee، نويسنده , , 2، نويسنده , , EunkyungPark، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
13
From page
302
To page
314
Abstract
In thispaper,wedealwithanewlot-sizingandschedulingproblem(LSSP)thatminimizesthesumof
production cost,setupcost,andinventorycost.Incorporatingtheconstraintsofsetupcarry-overand
overlapping aswellasdemandsplitting,wedevelopamixedintegerprogramming(MIP)formulation.
In theformulation,problemsizedoesnotincreaseasweenhancetheprecisionlevelofatimeperiod;
for example,bydividingatimeperiodintoanumberofmicrotimeperiods.Accordingly,intheproposed
model, wetreatthetimehorizonasacontinuumnotasacollectionofdiscretetimeperiods.Sincethe
problem istheoreticallyintractable,wedevelopasimplebutefficientheuristicalgorithmbydevisinga
decomposition schemecoupledwithalocalsearchprocedure.Evenifintheorytheheuristicmaynot
guarantee findingafeasiblesolution,computationalresultsdemonstratethattheproposedalgorithmisa
viable choiceinpracticeforfindinggoodqualityfeasiblesolutionswithinacceptabletimelimit.
Keywords
Heuristic , Lot-sizing and scheduling , Production system
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927646
Link To Document