A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times

DOI10.1057/palgrave.jors.2602020zbMath1113.90172OpenAlexW2047157537MaRDI QIDQ5477730

Jatinder N. D. Gupta, Edward F. jun. Stafford, F. T. Tseng

Publication date: 6 July 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602020

zbMATH Keywords

flowshop schedulingcomputational comparisonsminimizing makespansequence-dependent set-up timespenalty-based and savings index heuristic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ A survey of scheduling problems with setup times or costs ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem