Makespan minimization for two parallel machines with an availability constraint

DOI10.1016/j.ejor.2003.08.034zbMath1067.90046MaRDI QIDQ1887910

Chien-Hung Lin, Ching-Jong Liao, Der-Lin Shyur

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.034

zbMATH Keywords

Scheduling; Parallel machine; Makespan minimization; Availability constraint

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints, Approximation algorithms for scheduling with reservations, Makespan minimization for two parallel machines scheduling with a periodic availability constraint, A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, The effect of machine availability on the worst-case performance of LPT, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Two-machine flowshop scheduling with availability constraints
• Minimizing the sum of job completion times on capacitated parallel machines
• Current trends in deterministic scheduling
• A note on parallel machine scheduling with non-simultaneous machine available time
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Scheduling on semi-identical processors
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors