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

Clicks: 315
ID: 114963
2018
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #1 of 2 articles by views in 4or

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
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.