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

Single Machine Scheduling With Batch Delivery To Multiple Customers In A Star-Shaped Network

Author

Listed:
  • LEIYANG WANG

    (Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China)

  • ZHAOHUI LIU

    (Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China)

Abstract

In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then delivered in batches by a single vehicle with limited capacity to the respective customers located at the vertices of a star-shaped network. The goal is to minimize the makespan. We present a 3/2-approximation algorithm for the identical job size case and a 2-approximation algorithm for the non-identical job sizes case.

Suggested Citation

  • Leiyang Wang & Zhaohui Liu, 2013. "Single Machine Scheduling With Batch Delivery To Multiple Customers In A Star-Shaped Network," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(01), pages 1-9.
    • Handle: RePEc:wsi:apjorx:v:30:y:2013:i:01:n:s0217595912500480
    DOI: 10.1142/S0217595912500480
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500480
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912500480?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. Ling Liu & Wenli Li & Kunpeng Li & Xuxia Zou, 2020. "A coordinated production and transportation scheduling problem with minimum sum of order delivery times," Journal of Heuristics, Springer, vol. 26(1), pages 33-58, February.

    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:30:y:2013:i:01:n:s0217595912500480. 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.