A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10951-015-0453-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Paul Mireault & James B. Orlin & Rakesh V. Vohra, 1997. "A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines," Operations Research, INFORMS, vol. 45(1), pages 116-125, February.
- Koulamas, Christos & Kyparisis, George J., 2009. "A modified LPT algorithm for the two uniform parallel machine makespan minimization problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 61-68, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Johnny C. Ho & Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres, 2019. "A note on posterior tight worst-case bounds for longest processing time schedules," 4OR, Springer, vol. 17(1), pages 97-107, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Koulamas, Christos & Kyparisis, George J., 2009. "A modified LPT algorithm for the two uniform parallel machine makespan minimization problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 61-68, July.
- Alan J. Soper & Vitaly A. Strusevich, 2021. "Parametric analysis of the quality of single preemption schedules on three uniform parallel machines," Annals of Operations Research, Springer, vol. 298(1), pages 469-495, March.
- Christos Koulamas & George J. Kyparisis, 2006. "A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 568-575, September.
- Guo, Shouwei & Kang, Liying, 2010. "Online scheduling of malleable parallel jobs with setup times on two identical machines," European Journal of Operational Research, Elsevier, vol. 206(3), pages 555-561, November.
- Qian Cao & Zhaohui Liu, 2010. "Semi-online scheduling with known maximum job size on two uniform machines," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 369-384, November.
- Liao, Ching-Jong & Lin, Chien-Hung, 2003. "Makespan minimization for two uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 84(2), pages 205-213, May.
- Beezão, Andreza Cristina & Cordeau, Jean-François & Laporte, Gilbert & Yanasse, Horacio Hideki, 2017. "Scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 257(3), pages 834-844.
- Federico Della Croce & Rosario Scatamacchia, 2020. "The Longest Processing Time rule for identical parallel machines revisited," Journal of Scheduling, Springer, vol. 23(2), pages 163-176, April.
- Federico Della Croce & Rosario Scatamacchia & Vincent T’kindt, 2019. "A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 608-617, August.
- Leah Epstein, 2018. "A survey on makespan minimization in semi-online environments," Journal of Scheduling, Springer, vol. 21(3), pages 269-284, June.
- Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
More about this item
Keywords
Scheduling; Two uniform parallel machines; LPT schedule; Heuristic;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:19:y:2016:i:2:d:10.1007_s10951-015-0453-x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.