Title of article
Setting acommonduedateinaconstrainedflowshop:Avariable neighbourhoodsearchapproach
Author/Authors
Paz Perez-Gonzalez ، نويسنده , , JoseM.Framinan، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
1740
To page
1748
Abstract
In thispaperwestudyaduedatesettingprobleminaflowshoplayout.Theproblemconsistsof
schedulingasetofjobsarrivingtothesystemtogetherwithjobsalreadypresent(denotedasoldjobs),
in ordertosetacommonduedateforthenewjobs.Sincetheoldjobshaveacommonduedatethat
must notbeviolated,ourproblemisareschedulingproblemwiththeobjectiveofminimisingthe
makespanofthenewjobs(thusobtainingthetightestpossibleduedateforthenewjobs)anda
constraintsincethemaximumtardinessoftheoldjobsmustbeequaltozero.Thisapproachleadstoan
interestingschedulingprobleminwhichtwodifferentobjectivesareconsidered,eachoneforasubset
of thejobsthatmustbescheduled.Tothebestofourknowledge,thistypeofproblemshavebeen
scarcelyconsideredintheliterature,andonlyforveryspecificpurposes.Sinceourproblemisclearly
NP-hard,anewheuristicbasedonvariableneighbourhoodsearch(VNS)hasbeendesigned.
The computationalresultsshowthatourproposedheuristicoutperformstwoexistingheuristic
methodsforsimilarproblemsintheliterature.
Keywords
Metaheuristics , Due date setting , Flowshop , Common due date , Scheduling
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927780
Link To Document