Minimizing total weighted completion time with an unexpected machine unavailable interval

DOI10.1007/s10951-013-0328-yzbMath1297.90047OpenAlexW1987585802MaRDI QIDQ398911

Hairong Zhao, Boris Reznichenko, Yumei Huo

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-013-0328-y

zbMATH Keywords

approximation algorithmcompetitive ratiototal weighted completion timebreakdown modelemergent job modelunexpected machine unavailability

Mathematics Subject Classification ID

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

Related Items (6)

Semi-online scheduling on a single machine with unexpected breakdown ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ A note on minimizing total weighted completion time with an unexpected machine unavailable interval

Cites Work

• Unnamed Item
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
• Approximation schemes for parallel machine scheduling with availability constraints
• Single machine flow-time scheduling with scheduled maintenance
• Improved algorithms for two single machine scheduling problems
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Single machine flow-time scheduling with a single breakdown
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Approximability of scheduling with fixed jobs
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Machine scheduling with an availability constraint
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights

This page was built for publication: Minimizing total weighted completion time with an unexpected machine unavailable interval