Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
From MaRDI portal
Publication:814116
DOI10.1016/j.camwa.2005.07.008zbMath1127.90036OpenAlexW2138979525MaRDI QIDQ814116
Publication date: 2 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.07.008
schedulingworst-case analysisapproximation algorithmsavailability constraintsapproximabilityflexible flowshop
Related Items
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate, Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints, Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures, The hybrid flow shop scheduling problem, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS, Exponential inapproximability and FPTAS for scheduling with availability constraints
Cites Work
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Single machine flow-time scheduling with a single breakdown
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Approximability of flow shop scheduling
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Two-machine flowshop scheduling with consecutive availability constraints
- Parallel machines scheduling with machine shutdowns
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling on semi-identical processors
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Bounds for Certain Multiprocessing Anomalies
- Two-machine flow shops with limited machine availability