IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v48y2016i10p921-937.html
   My bibliography  Save this article

Designing supply networks under maximum customer order lead times

Author

Listed:
  • Frank Meisel
  • Walter Rei
  • Michel Gendreau
  • Christian Bierwirth

Abstract

We consider the problem of designing supply networks for producing and distributing goods under restricted customer order lead times. Companies apply various instruments for fulfilling orders within preset lead times, such as locating facilities close to markets, producing products to stock, choosing fast modes of transportation, or delivering products directly from plants to customers without the use of distribution centers. We provide two alternative models that consider these options to a different extent, when designing multi-layer, multi-product facility networks that guarantee meeting restricted lead times. A computational evaluation compares both models with respect to solvability and the quality of the obtained networks. We find that formulating the problem as a time–space network flow model considerably helps to design high-quality networks. Furthermore, the lead times quoted to customers affect the design of all layers in the supply network. In turn, this shows that when service requirements are applied, the strategic planning of the network should be adapted accordingly. Concerning the instruments considered for meeting quoted lead times, the choice between make-to-order and make-to-stock production is found to be of utmost importance, whereas transportation decisions have a minor impact.

Suggested Citation

  • Frank Meisel & Walter Rei & Michel Gendreau & Christian Bierwirth, 2016. "Designing supply networks under maximum customer order lead times," IISE Transactions, Taylor & Francis Journals, vol. 48(10), pages 921-937, October.
  • Handle: RePEc:taf:uiiexx:v:48:y:2016:i:10:p:921-937
    DOI: 10.1080/0740817X.2015.1110267
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1110267
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2015.1110267?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.

    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:taf:uiiexx:v:48:y:2016:i:10:p:921-937. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.