Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
From MaRDI portal
Publication:3705209
DOI10.1287/moor.10.4.576zbMath0582.90055MaRDI QIDQ3705209
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.4.576
heuristics; worst-case performance; maximum completion time; release date; two-machine flow-shop problem; without preemption
90B35: Deterministic scheduling theory in operations research
Related Items
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates., Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times., Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Two-stage flowshop scheduling with a common second-stage machine, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Approximation scheduling algorithms: a survey