Minimizing total weighted completion time with unexpected machine unavailability

DOI10.1007/978-3-642-31770-5_26MaRDI QIDQ3167370zbMATH OpenOpenAlexFDO

Authors Yumei Huo, Boris Reznichenko, Hairong Zhao

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_26

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing total weighted completion time with an unexpected machine unavailable interval
• A note on minimizing total weighted completion time with an unexpected machine unavailable interval
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
• scientific article; zbMATH DE number 1418278
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

Cited in

(6)

• Minimizing the weighted sum of completion times under processing time uncertainty
• Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
• A note on minimizing total weighted completion time with an unexpected machine unavailable interval
• On the completion time and the interruption time of a job processed on an unreliable machine
• Universal sequencing on a single machine
• Minimizing total weighted completion time with an unexpected machine unavailable interval

This page was built for publication: Minimizing total weighted completion time with unexpected machine unavailability

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