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

DOI10.1007/s11424-013-0335-2zbMath1310.68252OpenAlexW1988046468MaRDI QIDQ394448

Qi Feng, Yuhua Cai, Wen-Jie Li, Wei-Ping Shang

Publication date: 27 January 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-013-0335-2

zbMATH Keywords

on-line algorithmnonresumable availabilityparallel machines scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• The optimal on-line parallel machine scheduling
• 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
• A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME
• 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 for Certain Multiprocessing Anomalies
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Makespan minimization in online scheduling with machine eligibility
• On-line scheduling of parallel jobs with runtime restrictions

This page was built for publication: An on-line scheduling problem of parallel machines with common maintenance time