An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
From MaRDI portal
Publication:2390265
Recommendations
- Approximation results for flow shop scheduling problems with machine availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Two-machine flow shop problems with availability constraints
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- An improved algorithm for the two machine flow shop problem with several availability constraints
Cites work
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Machine scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling with limited machine availability
- Two-machine flow shops with limited machine availability
- Two-machine flowshop scheduling with consecutive availability constraints
Cited in
(25)- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Approximation results for the two-machine job shop under limited machine availability
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- An improved two-machine flowshop scheduling with intermediate transportation
- A two-stage flow shop scheduling with a critical machine and batch availability
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- Optimality of Jackson's permutations with respect to limited machine availability
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Open shop scheduling problem with a flexible maintenance period: revisited
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- 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
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- Flow shops with machine maintenance: ordered and proportionate cases
This page was built for publication: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390265)
