IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v51y2000i11d10.1057_palgrave.jors.2601016.html
   My bibliography  Save this article

Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines

Author

Listed:
  • J N D Gupta

    (Ball State University)

  • J C Ho

    (Columbus State University)

  • S Webster

    (Syracuse University)

Abstract

This paper proposes an efficient algorithm to solve optimally the bicriteria problem of minimising the weighted sum of makespan and mean flowtime on two identical parallel machines. The proposed algorithm allows the decision-maker to minimise makespan and flowtime simultaneously according to his or her relative preference as reflected through the weights placed on makespan and flowtime. Our computational results show that the proposed algorithm can solve optimally problem instances with a large number of jobs in a reasonably small amount of CPU time.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:51:y:2000:i:11:d:10.1057_palgrave.jors.2601016
    DOI: 10.1057/palgrave.jors.2601016
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601016
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. 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.
    2. J N D Gupta & A J Ruiz-torres & S Webster, 2003. "Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1263-1274, December.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    8. 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.

    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:pal:jorsoc:v:51:y:2000:i:11:d:10.1057_palgrave.jors.2601016. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.palgrave-journals.com/ .

    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.