Title of article
A tabu-searchalgorithmforschedulingjobswithcontrollableprocessing times onasinglemachinetomeetdue-dates
Author/Authors
Kailiang Xu ، نويسنده , , ZurenFeng، نويسنده , , KeliangJun، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
15
From page
1924
To page
1938
Abstract
In manyreal-worldproductionsystems,itisimportanttoschedulejobssuchthattheycouldbe
processedandshippedwithnodelay.Inthispaper,weconsidertheproblemofscheduling n jobs with
arbitraryreleasedatesandduedatesonasinglemachine,wherejob-processingtimescanbecontrolled
by theallocationofacommonresource,andtheoperationismodeledbyanon-linearconvexresource
consumptionfunction.Theobjectiveistoobtainanoptimalprocessingpermutationaswellasan
optimalresourceallocation,suchthatallthejobscanbefinishednolaterthantheirduedates,andthe
total resourceconsumptioncanbeminimized.Theproblemisstrongly NP- hard.Atwo-layer-
structuredalgorithmbasedonthetabu-searchispresented.Thecomputationalresult,comparedwith
that fromabranchandboundalgorithm,showsthealgorithmiscapableofproducingoptimalornear
optimalsolutionforlarge-sizedproblemsinanacceptablecomputationaltime.
Keywords
Single machine scheduling , Tabu-search , Convex resource consumption function
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927798
Link To Document