The LPT heuristic for minimizing total load on a proportionate openshop
From MaRDI portal
Publication:6110607
DOI10.1016/j.dam.2023.05.027zbMath1519.90071OpenAlexW4381167150MaRDI QIDQ6110607
Publication date: 2 August 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.05.027
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
- The two-machine no-wait general and proportionate open shop makespan problem
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Scheduling ordered open shops
- Parallel machines scheduling with nonsimultaneous machine available time
- A genetic algorithm for the proportionate multiprocessor open shop
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- The rate of convergence to optimality of the LPT rule
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- The effect of machine availability on the worst-case performance of LPT
- Sequential scheduling on identical machines
- A note on parallel machine scheduling with non-simultaneous machine available time
- The longest processing time rule for identical parallel machines revisited
- Minimizing total load on parallel machines with linear deterioration
- Approximation algorithms for the three-machine proportionate mixed shop scheduling
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- A note on the Coffman-Sethi bound for LPT scheduling
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
- A tabu search approach for proportionate multiprocessor open shop scheduling
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
- The Asymptotic Optimality of the LPT Rule
- Polynomial time approximation algorithms for proportionate open‐shop scheduling
- Bounds on Multiprocessing Timing Anomalies
- Multi-Machine Scheduling With Linear Deterioration
- A note on LPT scheduling
