A new sufficient condition of optimality for the two-machine flowshop problem
From MaRDI portal
Publication:2572845
DOI10.1016/j.ejor.2004.10.027zbMath1079.90050OpenAlexW2009261393MaRDI QIDQ2572845
H. Trung La, Cyril Briand, Jacques Erschler
Publication date: 4 November 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.10.027
Related Items (6)
A robust approach for the single machine scheduling problem ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ On the optimality conditions of the two-machine flow shop problem ⋮ TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES ⋮ The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
Cites Work
- Unnamed Item
- Unnamed Item
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- Project scheduling under uncertainty: survey and research potentials
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Optimal two- and three-stage production schedules with setup times included
- A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
This page was built for publication: A new sufficient condition of optimality for the two-machine flowshop problem
