Title of article
Discrepancy searchfortheflexiblejobshopschedulingproblem
Author/Authors
Abir BenHmida ، نويسنده , , MohamedHaouari d، نويسنده , , e، نويسنده , , Marie-Jose´ Huguet ، نويسنده , , PierreLopez ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
2192
To page
2201
Abstract
The flexiblejobshopschedulingproblem(FJSP)isageneralizationoftheclassicaljobshopproblemin
which eachoperationmustbeprocessedonagivenmachinechosenamongafinitesubsetofcandidate
machines.Theaimistofindanallocationforeachoperationandtodefinethesequenceofoperations
on eachmachine,sothattheresultingschedulehasaminimalcompletiontime.Weproposeavariantof
the climbingdiscrepancysearchapproachforsolvingthisproblem.Wealsopresentvarious
neighborhoodstructuresrelatedtoassignmentandsequencingproblems.Wereporttheresultsof
extensivecomputationalexperimentscarriedoutonwell-knownbenchmarksforflexiblejobshop
scheduling.Theresultsdemonstratethattheproposedapproachoutperformsthebest-known
algorithmsfortheFJSPonsometypesofbenchmarksandremainscomparablewiththemonotherones.
Keywords
Discrepancy search , Neighborhood structures , Scheduling , Allocation , Flexible job shop
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927822
Link To Document