Approximability of two-machine no-wait flowshop scheduling with availability constraints.
From MaRDI portal
Recommendations
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Approximation results for flow shop scheduling problems with machine availability constraints
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
Cites work
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Makespan minimization in open shops: A polynomial time approximation scheme
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
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
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- A survey of scheduling problems with no-wait in process
- Approximation results for the two-machine job shop under limited machine availability
- Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration
- Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Two-machine flow shop no-wait scheduling with machine maintenance
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- Minimizing the makespan in the no-wait flexible flowshop problem with availability constraint
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- A PTAS for a particular case of the two-machine flow shop with limited machine availability
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- 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
This page was built for publication: Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413925)
