Approximability of single machine scheduling with fixed jobs to minimize total completion time

DOI10.1016/j.ejor.2006.01.025zbMath1109.90047OpenAlexW2049084621MaRDI QIDQ857360

N. E. Zubov

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.025

zbMATH Keywords

schedulingsingle machineprecedence constraintsfixed jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Approximation schemes for parallel machine scheduling with availability constraints ⋮ Optimal algorithms for scheduling under time-of-use tariffs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine flow-time scheduling with scheduled maintenance
• Single machine flow-time scheduling with a single breakdown
• Approximability of scheduling with fixed jobs
• Machine scheduling with an availability constraint
• Complexity of Scheduling under Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Approximability of single machine scheduling with fixed jobs to minimize total completion time