Two-machine scheduling with periodic availability constraints to minimize makespan

DOI10.3934/jimo.2015.11.685zbMath1304.90097MaRDI QIDQ2514681

Ganggang Li, Xi-wen Lu

Publication date: 3 February 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2015.11.685

zbMATH Keywords

algorithm; scheduling; availability constraint; resumable; nonresumable

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Resilience analysis for project scheduling with renewable resource constraint and uncertain activity durations, Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint, A two-agent single-machine scheduling problem with late work criteria

Cites Work

• Single-machine scheduling with periodic maintenance to minimize makespan
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Makespan minimization for two parallel machines with an availability constraint
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Machine scheduling with an availability constraint
• Bounds on Multiprocessing Timing Anomalies