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

Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery

Author

Listed:
  • Hua Gong
  • Biao Zhang
  • Wuliang Peng

Abstract

We consider a single parallel-batching machine scheduling problem with delivery involving both batching scheduling and common due date assignment. The orders are first processed on the single parallel-batching machine and then delivered in batches to the customers. The batching machine can process several orders at the same time. The processing time of a production batch on the machine is equal to the longest processing time of the orders assigned into this batch. A common due date for all the orders in the same delivery batch and a delivery date for each order need to be determined in order to minimize total weighted flow time. We first prove that this problem is NP hard in the strong sense. Two optimal algorithms by using dynamic programming are derived for the two special cases with a given sequence of orders on the machine and a given batching in the production part, respectively.

Suggested Citation

  • Hua Gong & Biao Zhang & Wuliang Peng, 2015. "Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-7, April.
    • Handle: RePEc:hin:jnddns:464390
    DOI: 10.1155/2015/464390
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.

    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:jnddns:464390. 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.