IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v107y2001i1p51-6310.1023-a1014938712999.html
   My bibliography  Save this article

Single Supplier Scheduling for Multiple Deliveries

Author

Listed:
  • T.C. Cheng
  • Mikhail Kovalyov

Abstract

The problem of scheduling the production and delivery of a supplier to feed the production of F manufacturers is studied. The orders fulfilled by the supplier are delivered to the manufacturers in batches of the same size. The supplier's production line has to be set up whenever it switches from processing an order of one manufacturer to an order of another manufacturer. The objective is to minimize the total setup cost, subject to maintaining continuous production for all manufacturers. The problem is proved to be NP-hard. It is reduced to a single machine scheduling problem with deadlines and jobs belonging to F part types. An O(Nlog F) algorithm, where N is the number of delivery batches, is presented to find a feasible schedule. A dynamic programming algorithm with O(N F /F F−2 ) running time is presented to find an optimal schedule. If F=2 and setup costs are unit, an O(N) time algorithm is derived. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • T.C. Cheng & Mikhail Kovalyov, 2001. "Single Supplier Scheduling for Multiple Deliveries," Annals of Operations Research, Springer, vol. 107(1), pages 51-63, October.
    • Handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:51-63:10.1023/a:1014938712999
    DOI: 10.1023/A:1014938712999
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014938712999
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014938712999?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. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    2. Qi, Xiangtong, 2011. "Outsourcing and production scheduling for a two-stage flow shop," International Journal of Production Economics, Elsevier, vol. 129(1), pages 43-50, January.
    3. Yeung, Wing-Kwan & Choi, Tsan-Ming & Cheng, T.C.E., 2011. "Supply chain scheduling and coordination with dual delivery modes and inventory storage cost," International Journal of Production Economics, Elsevier, vol. 132(2), pages 223-229, August.
    4. Zhou, Feng & Blocher, James D. & Hu, Xinxin & Sebastian Heese, H., 2014. "Optimal single machine scheduling of products with components and changeover cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 75-83.

    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:spr:annopr:v:107:y:2001:i:1:p:51-63:10.1023/a:1014938712999. 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.springer.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.