Title of article
On schedulingasinglemachinewithresourcedependentreleasetimes
Author/Authors
Ignace MC Janssen، نويسنده , , R.J.D.Verbeek، نويسنده , , A.Volgenant ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
4
From page
713
To page
716
Abstract
We considerasinglemachineschedulingproblemwithresourcedependentreleasetimesthatcanbe
controlledbyanon-increasingconvexresourceconsumptionfunction.Theobjectiveistominimizethe
weightedtotalresourceconsumptionandsumofjobcompletiontimeswithaninitialreleasetime
greaterthanthetotalprocessingtimes.ItisknownthattheproblemispolynomiallysolvableinO(n4)
with n the numberofjobs.
We describeanimprovedalgorithmofcomplexityO(n log n). Weshowfurtherhowtoperform
sensitivityanalysisontheprocessingtimeofajobwithoutincreasingthecomplexity.
Keywords
Resource dependent release time , Polynomially solvable , Single machine scheduling
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927895
Link To Document