The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
From MaRDI portal
Publication:483213
DOI10.1007/s10852-013-9235-7zbMath1305.90185OpenAlexW1978059339MaRDI QIDQ483213
Najoua Dridi, Hatem Hadda, Sonia Hajri-Gabouj
Publication date: 16 December 2014
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-013-9235-7
Related Items (6)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ On the two-stage hybrid flow shop with dedicated machines ⋮ Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm ⋮ The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis ⋮ An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs ⋮ Approximation results for the two-machine job shop under limited machine availability
Cites Work
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- An improved algorithm for the two machine flow shop problem with several availability constraints
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- A branch and bound algorithm for the two-stage assembly scheduling problem
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Optimal two- and three-stage production schedules with setup times included
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- 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
- Two-machine flow shops with limited machine availability
This page was built for publication: The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
