Title of article
A two-stageflowshopschedulingproblemonabatchingmachineandadiscrete machine withblockingandsharedsetuptimes
Author/Authors
Hua Gong، نويسنده , , LixinTang، نويسنده , , C.W.Duinb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
960
To page
969
Abstract
Motivated byapplicationsinironandsteelindustry,weconsideratwo-stageflowshopscheduling
problem wherethefirstmachineisabatchingmachinesubjecttotheblockingconstraintandthesecond
machine isadiscretemachinewithsharedsetuptimes.WeshowthattheproblemisstronglyNP-hard
when theobjectiveistominimizethemakespan.Whensolvedwithaheuristicpriorityrule,theworstcase
ratio withtheminimummakespanis2.Foramoregeneralobjective,theminimizationofalinearcombi-
nation ofthemakespanandthetotalblockingtime,aquadraticmixedintegerprogramispresentedfirst.
Then wepinpointtwocaseswithpolynomialtimealgorithms:thecasewithoutblockingconstraintand
the casewithagivenjobsequence.Alsoforthegeneralobjective,weanalyzeanapproximationalgorithm.
Finally, weevaluatethealgorithms,givingexperimentalresultsonrandomlygeneratedtestproblems.
Keywords
Scheduling , Blocking , Batching machine , Setup time
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927705
Link To Document