IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i14p4164-4179.html
   My bibliography  Save this article

Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems

Author

Listed:
  • Erinc Albey
  • Ümit Bilge
  • Reha Uzsoy

Abstract

Nonlinear clearing functions have been proposed in the literature as metamodels to represent the behaviour of production resources that can be embedded in optimisation models for production planning. However, most clearing functions tested to date use a single-state variable to represent aggregate system workload over all products, which performs poorly when product mix affects system throughput. Clearing functions using multiple-state variables have shown promise, but require significant computational effort to fit the functions and to solve the resulting optimisation models. This paper examines the impact of aggregation in state variables on solution time and quality in multi-item multi-stage production systems with differing degrees of manufacturing flexibility. We propose multi-dimensional clearing functions using alternative aggregations of state variables, and evaluate their performance in computational experiments. We find that at low utilisation, aggregation of state variables has little effect on system performance; multi-dimensional clearing functions outperform single-dimensional ones in general; and increasing manufacturing flexibility allows the use of aggregate clearing functions with little loss of solution quality.

Suggested Citation

  • Erinc Albey & Ümit Bilge & Reha Uzsoy, 2017. "Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(14), pages 4164-4179, July.
  • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:14:p:4164-4179
    DOI: 10.1080/00207543.2016.1257169
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Srinivasan, A. & Carey, M. & Morton, T.E., 1988. "Resource Pricing And Aggregate Scheduling In Manufacturing Systems," GSIA Working Papers 88-89-58, Carnegie Mellon University, Tepper School of Business.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Beraudy, Sébastien & Absi, Nabil & Dauzère-Pérès, Stéphane, 2022. "Timed route approaches for large multi-product multi-step capacitated production planning problems," European Journal of Operational Research, Elsevier, vol. 300(2), pages 602-614.
    2. Gopalswamy, Karthick & Uzsoy, Reha, 2021. "Conic programming models for production planning with clearing functions: Formulations and duality," European Journal of Operational Research, Elsevier, vol. 292(3), pages 953-966.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kefeli, Ali & Uzsoy, Reha & Fathi, Yahya & Kay, Michael, 2011. "Using a mathematical programming model to examine the marginal price of capacitated resources," International Journal of Production Economics, Elsevier, vol. 131(1), pages 383-391, May.
    2. Po-Chen Lin & Reha Uzsoy, 2016. "Chance-constrained formulations in rolling horizon production planning: an experimental study," International Journal of Production Research, Taylor & Francis Journals, vol. 54(13), pages 3927-3942, July.
    3. Manda, A.B. & Uzsoy, Reha, 2021. "Managing product transitions with learning and congestion effects," International Journal of Production Economics, Elsevier, vol. 239(C).
    4. de Sampaio, Raimundo J.B. & Wollmann, Rafael R.G. & Vieira, Paula F.G., 2017. "A flexible production planning for rolling-horizons," International Journal of Production Economics, Elsevier, vol. 190(C), pages 31-36.
    5. Julia Pahl & Stefan Voß & David Woodruff, 2007. "Production planning with load dependent lead times: an update of research," Annals of Operations Research, Springer, vol. 153(1), pages 297-345, September.
    6. Gopalswamy, Karthick & Uzsoy, Reha, 2021. "Conic programming models for production planning with clearing functions: Formulations and duality," European Journal of Operational Research, Elsevier, vol. 292(3), pages 953-966.
    7. Missbauer, Hubert, 2011. "Order release planning with clearing functions: A queueing-theoretical analysis of the clearing function concept," International Journal of Production Economics, Elsevier, vol. 131(1), pages 399-406, May.
    8. Ghadimi, Foad & Aouam, Tarik & Haeussler, Stefan & Uzsoy, Reha, 2022. "Integrated and hierarchical systems for coordinating order acceptance and release planning," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1277-1289.
    9. Aouam, Tarik & Brahimi, Nadjib, 2013. "Integrated production planning and order acceptance under uncertainty: A robust optimization approach," European Journal of Operational Research, Elsevier, vol. 228(3), pages 504-515.
    10. Missbauer, Hubert, 2009. "Models of the transient behaviour of production units to optimize the aggregate material flow," International Journal of Production Economics, Elsevier, vol. 118(2), pages 387-397, April.
    11. Wen-Hsien Tsai & Yin-Hwa Lu, 2018. "A Framework of Production Planning and Control with Carbon Tax under Industry 4.0," Sustainability, MDPI, vol. 10(9), pages 1-24, September.
    12. Jakob Asmundsson & Ronald L. Rardin & Can Hulusi Turkseven & Reha Uzsoy, 2009. "Production planning with resources subject to congestion," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 142-157, March.
    13. Ali Kefeli & Reha Uzsoy, 2016. "Identifying potential bottlenecks in production systems using dual prices from a mathematical programming model," International Journal of Production Research, Taylor & Francis Journals, vol. 54(7), pages 2000-2018, April.
    14. A. Mustafin & A. Kantarbayeva, 2022. "Clearing function in the context of the invariant manifold method," Papers 2206.11205, arXiv.org.

    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:55:y:2017:i:14:p:4164-4179. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.