Title of article
Schedulingalgorithmsforasemiconductorprobingfacility
Author/Authors
June-Young Bang ، نويسنده , , Yeong-DaeKim، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
8
From page
666
To page
673
Abstract
This paperfocusesonaschedulingprobleminasemiconductorwaferprobingfacility.Intheprobing
facility,waferlotswithdistinctreadytimesareprocessedonaseriesofworkstations,eachwith
identicalparallelmachines.Wedevelopaheuristicalgorithmfortheproblemwiththeobjectiveof
minimizingtotaltardinessoforders.Thealgorithmemploysabottleneck-focusedschedulingmethod,
in whichascheduleatthebottleneckworkstationisconstructedfirstandthenschedulesforother
workstationsareconstructedbasedonthescheduleatthebottleneck.Forschedulingwaferlotsatthe
bottleneckworkstation,weconsiderprospectivetardinessofthelotsaswellassequence-dependent
setup timesrequiredbetweendifferenttypesofwaferlots.Wealsopresentarollinghorizonmethodfor
implementationoftheschedulingmethodonadynamicsituation.Thesuggestedmethodsare
evaluatedthroughaseriesofcomputationalexperimentsandresultsshowthatthemethodswork
betterthanexistingheuristicmethods.
Keywords
Scheduling , Semiconductor probing facility , Hybrid flowshop , Bottleneck-focused scheduling
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927890
Link To Document