On the two-stage assembly flow shop problem
From MaRDI portal
Publication:6592922
DOI10.1007/s11750-024-00664-0zbMATH Open1546.90061MaRDI QIDQ6592922
Najoua Dridi, Hatem Hadda, Sonia Hajri-Gabouj
Publication date: 26 August 2024
Published in: Top (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
- A branch and bound algorithm for the two-stage assembly scheduling problem
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- On the optimality conditions of the two-machine flow shop problem
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Scheduling for two-stage production system with setup and assembly operations
- Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
- 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
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimal scheduling of the 3-machine assembly-type flow shop
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The three-stage assembly flowshop scheduling problem
This page was built for publication: On the two-stage assembly flow shop problem
