Title of article :
A memeticalgorithmforminimizingtotalweightedtardinessonparallel
batch machineswithincompatiblejobfamiliesanddynamicjobarrival
Author/Authors :
Tsung-Che Chiang ، نويسنده , , Hsueh-ChienCheng، نويسنده , , Li-ChenFu، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
This paperaddressesaschedulingproblemmotivatedbyschedulingofdiffusionoperationsinthewafer
fabricationfacility.Inthetargetproblem,jobsarriveatthebatchmachinesatdifferenttimeinstants,
and onlyjobsbelongingtothesamefamilycanbeprocessedtogether.Parallelbatchmachine
schedulingtypicallyconsistsofthreetypesofdecisions—batch forming,machineassignment,and
batch sequencing.Weproposeamemeticalgorithmwithanewgenomeencodingschemetosearchfor
the optimalornear-optimalbatchformationandbatchsequencesimultaneously.Machineassignment
is resolvedintheproposeddecodingscheme.Crossoverandmutationoperatorssuitableforthe
proposedencodingschemearealsodevised.Throughtheexperimentwith4860probleminstancesof
variouscharacteristicsincludingthenumberofmachines,thenumberofjobs,andsoon,theproposed
algorithmdemonstratesitsadvantagesoverarecentlyproposedbenchmarkalgorithmintermsofboth
solution qualityandcomputationalefficiency.
Keywords :
Memetic algorithm , Total weighted tardiness , Scheduling , Batch processing machine
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
