IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i1-2p459-475.html
   My bibliography  Save this article

Dynamic order acceptance and capacity planning in a stochastic multi-project environment with a bottleneck resource

Author

Listed:
  • Philipp Melchiors
  • Roel Leus
  • Stefan Creemers
  • Rainer Kolisch

Abstract

We study the integration of order acceptance and capacity planning in multi-project environments with dynamically arriving projects. We model this planning problem as a continuous-time Markov decision process to determine long-term optimal decisions. We examine whether macro-process planning should be performed before or after order acceptance. We characterise the structure of optimal policies, and explore the dependence on a number of parameters such as project payoff, project cost and order arrival time. We also look into the effects of set-up costs and the use of non-regular capacity.

Suggested Citation

  • Philipp Melchiors & Roel Leus & Stefan Creemers & Rainer Kolisch, 2018. "Dynamic order acceptance and capacity planning in a stochastic multi-project environment with a bottleneck resource," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 459-475, January.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:1-2:p:459-475
    DOI: 10.1080/00207543.2018.1431417
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1431417
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1431417?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. Xin Li & José A. Ventura & Kevin A. Bunn, 2021. "A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime," Journal of Scheduling, Springer, vol. 24(1), pages 49-68, February.
    2. R. Micale & C. M. La Fata & M. Enea & G. La Scalia, 2021. "Regenerative scheduling problem in engineer to order manufacturing: an economic assessment," Journal of Intelligent Manufacturing, Springer, vol. 32(7), pages 1913-1925, October.

    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:tprsxx:v:56:y:2018:i:1-2:p:459-475. 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/TPRS20 .

    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.