Title of article
Solvingastochasticsinglemachineproblemwithinitialidletime and quadraticobjective
Author/Authors
H.M. Soroush، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
20
From page
1328
To page
1347
Abstract
Westudyastaticsinglemachineschedulingprobleminwhichprocessingtimesarestochastic,due-
dates andpenaltiesfornotcompletingjobsontimearedeterministic,andaninitialfixedidletimeis
allowedtobeinsertedbeforetheprocessingofthefirstjobbeginsonthemachine.Theobjectiveisto
determine the optimal sequenceandthe optimal initial idletimethatjointlyminimizetheexpected
valueofthesumofaquadraticcostfunctionofidletimeandtheweightedsumofaquadraticfunction
of joblateness.TheproblemisNP-hardtosolve;however,wedevelopanexactalgorithmbasedona
precedence relationstructureamongadjacentjobs.Ourextensivecomputationalresultsshowthatthe
algorithm cansolvelargeprobleminstancesquickly.Wealsodemonstratethattheproposedproblemis
generalinthesensethatitsspecialcasesreducetonewstochasticmodelswhileitslimitingcases
simplify tosomedeterministicmodels.
Keywords
Scheduling , Stochastic , JIT , Single machine , Quadratic lateness , Idle time
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927743
Link To Document