The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds

DOI10.1155/2012/748597zbMath1264.90088DBLPjournals/advor/Ding12OpenAlexW2094435620WikidataQ58698856 ScholiaQ58698856MaRDI QIDQ1953222

Wei Ding

Publication date: 7 June 2013

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/748597

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
• Scheduling problems on two sets of identical machines
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds