Generating improved dominance conditions for the flowshop problem
From MaRDI portal
(Redirected from Publication:580164)
Recommendations
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
- scientific article; zbMATH DE number 2186529
- 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
Cites work
- scientific article; zbMATH DE number 3278981 (Why is no real title available?)
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
- Permutation flow-shop theory revisited
- Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
- Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
- Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(4)- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- scientific article; zbMATH DE number 3883926 (Why is no real title available?)
- Minimizing total tardiness in permutation flowshops
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
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)