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

Clicks: 205
ID: 113241
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
Star

Ranked #2 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
Abstract is not available for this article.
Login to Search Abstract
Reference Key
ruiz-torres20184ora 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
10.1007/s10288-018-0381-7
URL
https://sciprofiles.com/publication/view/3817ba7f5f47e6fd0c8e8f898aae6cc1
Keywords
parallel machines 90c27 90c59 68w25 multiprocessor scheduling worst case analysis lpt algorithm 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.