Makespan minimization for two parallel machines scheduling with a periodic availability constraint

DOI10.1016/J.COR.2008.05.001zbMath1179.90166OpenAlexW2079294538MaRDI QIDQ1000962

Hong-Xing Li, Yunqiang Yin, Dehua Xu, Zhenmin Cheng

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.001

zbMATH Keywords

schedulingparallel machineheuristic algorithmavailability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Online and semi-online scheduling to minimize makespan on single machine with an availability constraint ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Some scheduling problems with general position-dependent and time-dependent learning effects ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ The study of group scheduling problems with general dual-position-based job processing times ⋮ An ILS heuristic for the ship scheduling problem: application in the oil industry ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects ⋮ A single-machine scheduling problem with maintenance activities to minimize makespan ⋮ Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies ⋮ Two-machine scheduling with periodic availability constraints to minimize makespan ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan

Cites Work

• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
• Single-machine scheduling with periodic maintenance to minimize makespan
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Two-machine flowshop scheduling with consecutive availability constraints
• 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
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Machine scheduling with an availability constraint
• Machine scheduling with an availability constraint and job delivery coordination
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Makespan minimization for two parallel machines scheduling with a periodic availability constraint