Pages that link to "Item:Q3011186"
From MaRDI portal
The following pages link to Resource Management in Machine Scheduling Problems: A Survey (Q3011186):
Displaying 13 items.
- Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Single-machine group scheduling with processing times dependent on position, starting time and allotted resource (Q1634004) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment (Q6635995) (← links)
