A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
From MaRDI portal
Publication:282256
DOI10.1007/S10951-015-0453-XzbMath1341.90054OpenAlexW2188096037MaRDI QIDQ282256
Alex J. Ruiz-Torres, Giuseppe Paletta, Ivar Massabò
Publication date: 12 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0453-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
A note on posterior tight worst-case bounds for longest processing time schedules ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tighter bound for MULTIFIT scheduling on uniform processors
- Parametric bounds for LPT scheduling on uniform processors
- A note on MULTIFIT scheduling for uniform machines
- A note on the Coffman-Sethi bound for LPT scheduling
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
- Scheduling Independent Tasks on Uniform Processors
- Bounds for Multifit Scheduling on Uniform Processors
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Bounds for LPT Schedules on Uniform Processors
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A note on LPT scheduling
This page was built for publication: A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
