IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1647401.html
   My bibliography  Save this article

Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan

Author

Listed:
  • Lisi Cao
  • Jianhong Hao
  • Dakui Jiang

Abstract

A problem of parallel machine scheduling with coordinated job deliveries is handled to minimize the makespan. Different jobs call for dissimilar sizes of storing space in the process of transportation. A range of jobs of one customer in the problem have priority to be processed on two identical parallel machines without preemption and then delivered to the customer by two vehicles in batches. For this NP-hard problem, we first prove that it is impossible to have a polynomial heuristic with a worst-case performance ratio bound less than 2 unless P = NP. Thereafter, we develop a polynomial heuristic for this problem, the worst-case ratio of which is bounded by 2.

Suggested Citation

  • Lisi Cao & Jianhong Hao & Dakui Jiang, 2020. "Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan," Complexity, Hindawi, vol. 2020, pages 1-6, January.
    • Handle: RePEc:hin:complx:1647401
    DOI: 10.1155/2020/1647401
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/1647401.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2020/1647401.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/1647401?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
    ---><---

    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:hin:complx:1647401. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.