Approximation results for flow shop scheduling problems with machine availability constraints
From MaRDI portal
(Redirected from Publication:954036)
Recommendations
- Two-machine flow shop problems with availability constraints
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Two-machine flowshop scheduling with availability constraints
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Machine scheduling with an availability constraint
- Makespan minimization in open shops: A polynomial time approximation scheme
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Optimal two- and three-stage production schedules with set-up time included
- Two-machine flow shops with limited machine availability
- Two-machine flowshop scheduling with availability constraints
- Two-machine flowshop scheduling with consecutive availability constraints
Cited in
(27)- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Open shop scheduling problem with a non-resumable flexible maintenance period
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Flow shops with machine maintenance: ordered and proportionate cases
- Approximability of flow shop scheduling
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- An improved algorithm for the two machine flow shop problem with several availability constraints
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
- 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 and open shop scheduling problems with a single maintenance window
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Two-machine flow shop problems with availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- On-line and semi-online scheduling for flow shop problems on two machines
- 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
- Approximation results for the two-machine job shop under limited machine availability
- Single machine scheduling with semi-resumable machine availability constraints
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
This page was built for publication: Approximation results for flow shop scheduling problems with machine availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954036)
