Generating improved dominance conditions for the flowshop problem

DOI10.1016/0305-0548(87)90056-6zbMath0625.90044OpenAlexW2000913749MaRDI QIDQ580164

J. George Shanthikumar, Wlodzimierz Szwarc, Jatinder N. D. Gupta

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90056-6

zbMATH Keywords

branch-and-bounddominance conditionsflowship scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing total tardiness in permutation flowshops, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

Cites Work

• Unnamed Item
• Permutation flow-shop theory revisited
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
• Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem