Pages that link to "Item:Q2842183"
From MaRDI portal
The following pages link to Optimal Batch Schedules for Parallel Machines (Q2842183):
Displaying 16 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Optimal read-once parallel disk scheduling (Q818672) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal (Q1703454) (← links)
- Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- (Q3405068) (← links)
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines (Q3829340) (← links)
- (Q4209155) (← links)
- Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations (Q5039314) (← links)
