Pages that link to "Item:Q935202"
From MaRDI portal
The following pages link to An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202):
Displayed 11 items.
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint (Q1653364) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources (Q1751153) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- Scheduling on two identical machines with a speed-up resource (Q1944144) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)