Two-machine flow shop problems with availability constraints
From MaRDI portal
Publication:2887149
zbMATH Open1249.90085MaRDI QIDQ2887149FDOQ2887149
Publication date: 1 June 2012
Published in: Operations Research Transactions (Search for Journal in Brave)
Recommendations
- Approximation results for flow shop scheduling problems with machine availability constraints
- Two-machine flowshop scheduling with consecutive availability constraints
- 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 flow shop scheduling with an availability constraint and nonresumable jobs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (21)
- Scheduling two-stage hybrid flow shop with availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- On-line and semi-online scheduling for flow shop problems on two machines
- Two-machine flowshop scheduling with consecutive availability constraints
- Scheduling with availability constraints
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- Approximation results for the two-machine job shop under limited machine availability
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
- A two-stage flow shop scheduling with a critical machine and batch availability
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- Two-machine flow shops with limited machine availability
- Average cost optimality for an unreliable two-machine flowshop with limited internal buffer
- Approximation results for flow shop scheduling problems with machine availability constraints
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Two-machine scheduling with periodic availability constraints to minimize makespan
This page was built for publication: Two-machine flow shop problems with availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887149)
