Pages that link to "Item:Q1575603"
From MaRDI portal
The following pages link to Scheduling preemptable tasks on parallel processors with limited availability (Q1575603):
Displaying 22 items.
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines (Q439457) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Online scheduling on semi-related machines (Q963475) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- (Q3680271) (← links)
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors (Q3806974) (← links)
- Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors (Q4376737) (← links)
- Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
- Minimizing maximum tardiness in single FMS machine scheduling with tool changes (Q5188152) (← links)
- New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)
