Optimal batch schedules for parallel machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080262
- Minimizing makespan in batch machine scheduling
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Scheduling problems on parallel identical unbounded batch processing machines
- Batch scheduling of identical jobs on parallel identical machines
Cited in
(16)- Parallel machine batching and scheduling with deadlines
- 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
- 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
- Scheduling tasks to minimize active time on a processor with unlimited capacity
- Active and busy time scheduling problem: a survey
- scientific article; zbMATH DE number 5671136 (Why is no real title available?)
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines
- scientific article; zbMATH DE number 1206104 (Why is no real title available?)
- Optimizing busy time on parallel machines
- Construction of schedules for the performance of task packages in multi-stage systems when forming sets of results and limitations
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- Optimal read-once parallel disk scheduling
This page was built for publication: Optimal batch schedules for parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842183)