Title of article :
Fast neighborhoodsearchforthesinglemachineearliness–tardiness
schedulingproblem
Author/Authors :
Safia Kedad-Sidhoum، نويسنده , , FrancisSourd، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
This paperaddressestheonemachineschedulingprobleminwhich n jobs havedistinctduedateswith
earlinessandtardinesscosts.Fastneighborhoodsareproposedfortheproblem.Theyarebasedona
block representationoftheschedule.Atimingoperatorispresentedaswellasswapandextract-and-
reinsertneighborhoods.Theyareusedinaniteratedlocalsearchframework.Twotypesof
perturbationsaredevelopedbased,respectively,onrandomswapsandearlinessandtardinesscosts.
Computationalresultsshowthatverygoodsolutionsforinstanceswithsignificantlymorethan100
jobs canbederivedinafewseconds.
Keywords :
Machine scheduling , Earliness–tardiness , Neighborhood , Iterated local search
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
