Makespan minimization for two parallel machines with an availability constraint

DOI10.1016/J.EJOR.2003.08.034MaRDI QIDQ1887910zbMATH OpenOpenAlexFDO

Authors Ching-Jong Liao, Der-Lin Shyur, 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

zbMATH Keywords

Availability constraintMakespan minimizationParallel machineScheduling

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Makespan minimization for parallel machines scheduling with multiple availability constraints
• Parallel machine makespan minimization subject to machine availability and total completion time constraints
• Minimizing makespan for two parallel machines with job limit on each availability interval
• Two-machine scheduling with periodic availability constraints to minimize makespan

Cites work

• A note on parallel machine scheduling with non-simultaneous machine available time
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Current trends in deterministic scheduling
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 849179 (Why is no real title available?)
• Machine scheduling with an availability constraint
• Minimizing the sum of job completion times on capacitated parallel machines
• Parallel machines scheduling with nonsimultaneous machine available time
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Scheduling jobs and maintenance activities on parallel machines
• Scheduling on semi-identical processors
• Scheduling with limited machine availability
• Two-machine flowshop scheduling with availability constraints

Cited in

(26)

• 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
• 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
• The effect of machine availability on the worst-case performance of LPT
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Parallel machine makespan minimization subject to machine availability and total completion time constraints
• Two-machine scheduling with periodic availability constraints to minimize makespan
• Order acceptance and two parallel machines scheduling problem with an availability constraint
• Online and semi-online scheduling on capacitated two-parallel machines
• Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling
• Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
• Scheduling two parallel machines with machine-dependent availabilities
• Makespan Minimization with Machine Availability Constraints
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
• Minimizing flowtime subject to optimal makespan on two identical parallel machines
• Minimizing makespan for two parallel machines with job limit on each availability interval
• Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
• Approximation algorithms for scheduling with reservations
• Resource allocation to minimize the makespan with multi-resource operations
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
• Makespan minimization for parallel machines scheduling with multiple availability constraints

This page was built for publication: Makespan minimization for two parallel machines with an availability constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887910)