Makespan minimization for two parallel machines with an availability constraint
From MaRDI portal
Publication:1887910
DOI10.1016/j.ejor.2003.08.034zbMath1067.90046OpenAlexW2048135710MaRDI QIDQ1887910
Der-Lin Shyur, Ching-Jong Liao, Chien-Hung Lin
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
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (17)
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints ⋮ Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ The effect of machine availability on the worst-case performance of LPT ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint ⋮ Approximation algorithms for scheduling with reservations ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint ⋮ Two-machine scheduling with periodic availability constraints to minimize makespan ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Cites Work
- 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
- Scheduling jobs and maintenance activities on parallel machines
This page was built for publication: Makespan minimization for two parallel machines with an availability constraint
