ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
From MaRDI portal
Publication:3022023
DOI10.1142/S0129054104002637zbMath1067.90512OpenAlexW1969091796MaRDI QIDQ3022023
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002637
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Mixed batch scheduling on identical machines ⋮ Single machine batch scheduling with release times ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES ⋮ Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
Cites Work
This page was built for publication: ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING