IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2206.11205.html
   My bibliography  Save this paper

Clearing function in the context of the invariant manifold method

Author

Listed:
  • A. Mustafin
  • A. Kantarbayeva

Abstract

Clearing functions (CFs), which express a mathematical relationship between the expected throughput of a production facility in a planning period and its workload (or work-in-progress, WIP) in that period have shown considerable promise for modeling WIP-dependent cycle times in production planning. While steady-state queueing models are commonly used to derive analytic expressions for CFs, the finite length of planning periods calls their validity into question. We apply a different approach to propose a mechanistic model for one-resource, one-product factory shop based on the analogy between the operation of machine and enzyme molecule. The model is reduced to a singularly perturbed system of two differential equations for slow (WIP) and fast (busy machines) variables, respectively. The analysis of this slow-fast system finds that CF is nothing but a result of the asymptotic expansion of the slow invariant manifold. The validity of CF is ultimately determined by how small is the parameter multiplying the derivative of the fast variable. It is shown that sufficiently small characteristic ratio 'working machines : WIP' guarantees the applicability of CF approximation in unsteady-state operation.

Suggested Citation

  • A. Mustafin & A. Kantarbayeva, 2022. "Clearing function in the context of the invariant manifold method," Papers 2206.11205, arXiv.org.
    • Handle: RePEc:arx:papers:2206.11205
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2206.11205
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hubert Missbauer & Reha Uzsoy, 2020. "Production Planning with Capacitated Resources and Congestion," Springer Books, Springer, number 978-1-0716-0354-3, September.
    2. 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.
    3. A.Ponzi & A.Yasutomi, 2003. "A Non-Linear Model of Economic Production Processes," Computing in Economics and Finance 2003 308, Society for Computational Economics.
    4. D. Armbruster, 2012. "The Production Planning Problem: Clearing Functions, Variable Lead Times, Delay Equations and Partial Differential Equations," Springer Books, in: Dieter Armbruster & Karl G. Kempf (ed.), Decision Policies for Production Networks, edition 127, pages 289-302, Springer.
    5. 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.
    6. Stephen C. Graves, 1986. "A Tactical Planning Model for a Job Shop," Operations Research, INFORMS, vol. 34(4), pages 522-533, August.
    7. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    8. Ponzi, A. & Yasutomi, A. & Kaneko, K., 2003. "A non-linear model of economic production processes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 324(1), pages 372-379.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Manda, A.B. & Uzsoy, Reha, 2021. "Managing product transitions with learning and congestion effects," International Journal of Production Economics, Elsevier, vol. 239(C).
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Haeussler, Stefan & Missbauer, Hubert, 2014. "Empirical validation of meta-models of work centres in order release planning," International Journal of Production Economics, Elsevier, vol. 149(C), pages 102-116.
    11. 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.
    12. Ponzi, A. & Yasutomi, A. & Kaneko, K., 2006. "Complex dynamical behaviour in economic production networks," Journal of Economic Behavior & Organization, Elsevier, vol. 61(4), pages 729-749, December.
    13. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    14. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    15. Peter J. H. Hulshof & Martijn R. K. Mes & Richard J. Boucherie & Erwin W. Hans, 2016. "Patient admission planning using Approximate Dynamic Programming," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 30-61, June.
    16. Jaime González & Juan-Carlos Ferrer & Alejandro Cataldo & Luis Rojas, 2019. "A proactive transfer policy for critical patient flow management," Health Care Management Science, Springer, vol. 22(2), pages 287-303, June.
    17. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    18. Scott Webster & Z. Kevin Weng, 2001. "Improving Repetitive Manufacturing Systems: Model and Insights," Operations Research, INFORMS, vol. 49(1), pages 99-106, February.
    19. Abhishek, & Legros, Benjamin & Fransoo, Jan C., 2021. "Performance evaluation of stochastic systems with dedicated delivery bays and general on-street parking," Other publications TiSEM 09ed9572-d59c-4f28-a9c4-b, Tilburg University, School of Economics and Management.
    20. 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.

    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:arx:papers:2206.11205. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.