Pages that link to "Item:Q3806974"
From MaRDI portal
The following pages link to Scheduling Independent Tasks with Deadlines on Semi-identical Processors (Q3806974):
Displaying 27 items.
- Scheduling independent two processor tasks on a uniform duo-processor system (Q751995) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Machine scheduling with an availability constraint (Q2564885) (← links)
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION (Q3013566) (← links)
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3789320) (← links)
- An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates (Q4398895) (← links)
- Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)
- (Q4934199) (← links)
- Experimental and Efficient Algorithms (Q5710026) (← links)
- Scheduling with unexpected machine breakdowns (Q5936454) (← links)
- Two-machine flow shops with limited machine availability (Q5953341) (← links)
- Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)