A note on posterior tight worst-case bounds for longest processing time schedules
From MaRDI portal
Publication:2423296
DOI10.1007/s10288-018-0381-7zbMath1410.68068OpenAlexW2808215043MaRDI QIDQ2423296
Alex J. Ruiz-Torres, Giuseppe Paletta, Johnny C. Ho, Ivar Massabò
Publication date: 21 June 2019
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-018-0381-7
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
- A state-of-the-art review of parallel-machine scheduling research
- The rate of convergence to optimality of the LPT rule
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- A note on the Coffman-Sethi bound for LPT scheduling
- A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- The Asymptotic Optimality of the LPT Rule
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- An Application of Bin-Packing to Multiprocessor Scheduling
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A note on LPT scheduling
This page was built for publication: A note on posterior tight worst-case bounds for longest processing time schedules
