A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME

DOI10.1142/S0217595912500200zbMath1250.90033MaRDI QIDQ2920365

Qi Feng, Yuhua Cai, Wen-Jie Li

Publication date: 16 October 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

competitive ratioon-line algorithmcommon maintenance timesemi-on-line scheduling

Mathematics Subject Classification ID

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

Related Items (1)

An on-line scheduling problem of parallel machines with common maintenance time

Cites Work

• Parallel machines scheduling with nonsimultaneous machine available time
• The effect of machine availability on the worst-case performance of LPT
• Parallel machines scheduling with machine shutdowns
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• Machine scheduling with an availability constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Better Bounds for Online Scheduling
• Improved Bounds for the Online Scheduling Problem
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• Bounds on Multiprocessing Timing Anomalies
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

This page was built for publication: A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME