IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i04ns0217595914500250.html
   My bibliography  Save this article

Batching Machine Scheduling With Bicriteria: Maximum Cost And Makespan

Author

Listed:
  • CHENG HE

    (School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China)

  • HAO LIN

    (School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China)

  • JINJIANG YUAN

    (Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China)

  • YUNDONG MU

    (School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China)

Abstract

In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest processing time of jobs in the batch. The main goal of a multicriteria problem is to find Pareto optimal solutions. We present a polynomial-time algorithm to produce all Pareto optimal solutions of this bicriteria scheduling problem.

Suggested Citation

  • Cheng He & Hao Lin & Jinjiang Yuan & Yundong Mu, 2014. "Batching Machine Scheduling With Bicriteria: Maximum Cost And Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-10.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500250
    DOI: 10.1142/S0217595914500250
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500250
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500250?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. Yuan Gao & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng, 2022. "Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost," 4OR, Springer, vol. 20(2), pages 273-287, June.

    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:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500250. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.