Generating improved dominance conditions for the flowshop problem

DOI10.1016/0305-0548(87)90056-6zbMATH Open0625.90044OpenAlexW2000913749MaRDI QIDQ580164FDOQ580164

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

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

Recommendations

• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• scientific article
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
• Nonpreemptive flowshop scheduling with machine dominance
• scientific article; zbMATH DE number 3883926

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)

Cites Work

• The Complexity of Flowshop and Jobshop Scheduling
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
• Permutation flow-shop theory revisited
• Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
• Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• Minimizing total tardiness in permutation flowshops

This page was built for publication: Generating improved dominance conditions for the flowshop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580164)