An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
From MaRDI portal
Publication:972619
DOI10.1007/S10288-009-0102-3zbMATH Open1186.90050OpenAlexW2046510690MaRDI QIDQ972619FDOQ972619
Authors: Hatem Hadda, Najoua Dridi, Sonia Hajri-Gabouj 
Publication date: 21 May 2010
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-009-0102-3
Recommendations
- 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
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Two-machine flowshop scheduling with availability constraints
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Cites Work
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Optimal two- and three-stage production schedules with set-up time included
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Scheduling two-stage hybrid flow shop with availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
Cited In (14)
- An improved algorithm for the two machine flow shop problem with several availability constraints
- A PTAS for non-resumable open shop scheduling with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- Approximation results for the two-machine job shop under limited machine availability
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- A PTAS for a particular case of the two-machine flow shop with limited machine availability
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Two-machine flow shop problems with availability constraints
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
This page was built for publication: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972619)
