A note on minimizing total weighted completion time with an unexpected machine unavailable interval

DOI10.1007/S10951-018-0573-1zbMath1427.90152OpenAlexW2807027913MaRDI QIDQ2281620

Peihai Liu, Chao Wang, Xi-wen Lu

Publication date: 3 January 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0573-1

zbMATH Keywords

competitive ratiototal weighted completion timebreakdown modelemergent job modelunexpected machine unavailability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Minimizing total weighted completion time with an unexpected machine unavailable interval
• Single machine flow-time scheduling with scheduled maintenance
• Scheduling with limited machine availability

This page was built for publication: A note on minimizing total weighted completion time with an unexpected machine unavailable interval