Pages that link to "Item:Q1043331"
From MaRDI portal
The following pages link to Resource level minimization in the discrete-continuous scheduling (Q1043331):
Displaying 15 items.
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- Resource leveling in a machine environment (Q418090) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
- Approximation algorithms for some discrete-continuous scheduling problems (Q1332457) (← links)
- Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
- On a certain class of power- and energy-related scheduling problems (Q2422748) (← links)
- Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times (Q2931172) (← links)
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
