Optimal Batch Schedules for Parallel Machines
From MaRDI portal
Publication:2842183
DOI10.1007/978-3-642-40104-6_41zbMath1390.68131OpenAlexW2149206167MaRDI QIDQ2842183
Samir Khuller, Frederic Koehler
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_41
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations, Two faster algorithms for coordination of production and batch delivery: a note, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost, Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine, LP rounding and combinatorial algorithms for minimizing active and busy time, Co-scheduling algorithms for high-throughput workload execution, Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal, Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity, Active and Busy Time Scheduling Problem: A Survey, A model for minimizing active processor time
