IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v84y2003i2p205-213.html
   My bibliography  Save this article

Makespan minimization for two uniform parallel machines

Author

Listed:
  • Liao, Ching-Jong
  • Lin, Chien-Hung

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:84:y:2003:i:2:p:205-213
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(02)00427-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Johnny C. Ho & Johnny S. Wong, 1995. "Makespan minimization for m parallel identical processors," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 935-948, September.
    2. J N D Gupta & J C Ho & S Webster, 2000. "Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(11), pages 1330-1339, November.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liao, Ching-Jong & Chao, Chien-Wen & Lin, Chien-Hung, 2009. "Minimizing the sum of job completion times on capacitated two-parallel machines," European Journal of Operational Research, Elsevier, vol. 197(2), pages 475-481, September.
    2. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    3. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    4. Ruiz-Torres, Alex J. & Lopez, Francisco J. & Ho, Johnny C., 2007. "Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 179(2), pages 302-315, June.
    5. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    6. Fei, Hongying & Meskens, Nadine & Combes, Catherine & Chu, Chengbin, 2009. "The endoscopy scheduling problem: A case study with two specialised operating rooms," International Journal of Production Economics, Elsevier, vol. 120(2), pages 452-462, August.

    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.
    1. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    2. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    3. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    4. 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.
    5. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    7. 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.
    8. 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.
    9. Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres, 2016. "A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem," Journal of Scheduling, Springer, vol. 19(2), pages 207-211, April.
    10. 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.
    11. Lin, Yang-Kuei & Fowler, John W. & Pfund, Michele E., 2013. "Multiple-objective heuristics for scheduling unrelated parallel machines," European Journal of Operational Research, Elsevier, vol. 227(2), pages 239-253.
    12. Peruvemba Sundaram Ravi & Levent Tunçel & Michael Huang, 2016. "Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime," Journal of Scheduling, Springer, vol. 19(5), pages 547-561, October.
    13. Yang-Kuei Lin & Tzu-Yueh Yin, 2022. "Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time," Annals of Operations Research, Springer, vol. 319(2), pages 1655-1688, December.
    14. Navid Hashemian & Claver Diallo & Béla Vizvári, 2014. "Makespan minimization for parallel machines scheduling with multiple availability constraints," Annals of Operations Research, Springer, vol. 213(1), pages 173-186, February.
    15. 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.
    16. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2023. "Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time," European Journal of Operational Research, Elsevier, vol. 305(2), pages 594-607.
    17. 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.
    18. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    19. C-J Liao & C-M Chen & C-H Lin, 2007. "Minimizing makespan for two parallel machines with job limit on each availability interval," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 938-947, July.
    20. Leah Epstein, 2018. "A survey on makespan minimization in semi-online environments," Journal of Scheduling, Springer, vol. 21(3), pages 269-284, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:eee:proeco:v:84:y:2003:i:2:p:205-213. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.