Pages that link to "Item:Q5393022"
From MaRDI portal
The following pages link to Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022):
Displaying 13 items.
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources (Q1751153) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- Scheduling on two identical machines with a speed-up resource (Q1944144) (← links)
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- ONLINE SCHEDULING OF MIXED CPU-GPU JOBS (Q2941090) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
