A note on posterior tight worst-case bounds for longest processing time schedules

Clicks: 219
ID: 114963
2018
Free PDF
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
This note proposes and analyzes a posterior tight worst-case bound for the longest processing time (LPT) heuristic for scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. It makes natural remarks on the well-known posterior worst-case bounds, and shows that the proposed bound can complement the well-known posterior bounds to synergistically achieve a better posterior worst-case bound for the LPT heuristic. Moreover, it gives some insight on LPT asymptotical optimality.
Reference Key
ho20184ora Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Johnny C. Ho;Ivar Massabò;Giuseppe Paletta;Alex J. Ruiz-Torres;Johnny C. Ho;Ivar Massabò;Giuseppe Paletta;Alex J. Ruiz-Torres;
Journal 4or
Year 2018
DOI
doi:10.1007/s10288-018-0381-7
URL
https://doi.org/10.1007/s10288-018-0381-7
Keywords
optimization industrial and production engineering operations research/decision theory

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.