Pages that link to "Item:Q1775060"
From MaRDI portal
The following pages link to The effect of machine availability on the worst-case performance of LPT (Q1775060):
Displaying 17 items.
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times (Q1355924) (← links)
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- Parallel machines scheduling with machine shutdowns (Q1806577) (← links)
- A semi-on-line scheduling problem of two parallel machines with common maintenance time (Q2920365) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Scheduling with deterioration effects and maintenance activities under parallel processors (Q6048066) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
