On the optimality conditions of the two-machine flow shop problem
From MaRDI portal
Publication:1754105
DOI10.1016/j.ejor.2017.09.029zbMath1403.90331OpenAlexW2758657397MaRDI QIDQ1754105
Mohamed Karim Hajji, Hatem Hadda, Najoua Dridi
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.09.029
Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- Minimizing makespan in hybrid flowshops
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Project scheduling under uncertainty: survey and research potentials
- Heuristics for scheduling in a flow shop with multiple processors
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- A note on the two-stage hybrid flow shop problem with dedicated machines
- Two-machine shop scheduling: Compromise between flexibility and makespan value
- A new sufficient condition of optimality for the two-machine flowshop problem
- 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
- On the two-stage hybrid flow shop with dedicated machines
- Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem