Mathematical Problems in Engineering

Research Article

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

Table 1

Literature review of the HFS-SDST problem.
Ref.ProblemSetup typeCriterionApproach
[6]SDFMakespan; total tardinessGA
[7]SDMakespan; total completion timeImproved MH
[8]SDMakespan; total tardinessImproved SA
[9]SDMakespanLeaning IG
[10]SDTotal tardiness; total setup timesEA
[11]SDThe total weighted completion timeABC
[12]SDTotal tardinessAn integrated approach based on ANN, GA, and CS
[13]Inner SDMakespanRegeneration GA
[14]SDFPM cost; repair cost; tardinessSA with GA
[15]SDMakespan; total tardinessImproved GA
[16]SDTotal tardinessACS
[17]SDMakespan; tardinessEA
[18]SDFTotal completion timeMA
[19]SD/MDMakespan; the total weighted tardinessPareto approach
[20]SDFMakespanGA
[21]SDMakespanImproved GA
[22]SDFMakespan; total weighted tardinessMultipopulation GA
[23]SDThe sum of earliness and tardinessHybrid method based on AC and SA
[24]SDFMakespan; total weighted tardinessA multiphase approach
[25]SDTotal weighted tardinessElectromagnetism algorithm
[26]SDMakespanHeuristics based on SPT, LPT, and Johnson
[27]SDMakespan; total tardinessSA
[28]SD/MDTotal completion time; the number of tardy jobsHeuristics, SA, GA, TS
[29]SDMakespanIA
[30]SDFMakespanHeuristics
[31]SDMakespanGreed method; flow line method; NEH; GA
[32]SDMakespanHeuristics
[33]SDMakespanTS
[34]SDFMakespan; total tardinessHeuristics
[35]SDMakespanHybrid algorithm on GA and TS
[36]SDMakespanB&B; TS; heuristics