IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v7y2010i1p61-83.html
   My bibliography  Save this article

A hydrodynamic modelling framework for production networks

Author

Listed:
  • Apostolos Kotsialos

Abstract

No abstract is available for this item.

Suggested Citation

  • Apostolos Kotsialos, 2010. "A hydrodynamic modelling framework for production networks," Computational Management Science, Springer, vol. 7(1), pages 61-83, January.
    • Handle: RePEc:spr:comgts:v:7:y:2010:i:1:p:61-83
    DOI: 10.1007/s10287-008-0076-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-008-0076-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-008-0076-1?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. Dieter Armbruster & Daniel E. Marthaler & Christian Ringhofer & Karl Kempf & Tae-Chang Jo, 2006. "A Continuum Model for a Re-entrant Factory," Operations Research, INFORMS, vol. 54(5), pages 933-950, October.
    2. Stephen C. Graves, 1986. "A Tactical Planning Model for a Job Shop," Operations Research, INFORMS, vol. 34(4), pages 522-533, August.
    3. Papageorgiou, Markos, 1990. "Dynamic modeling, assignment, and route guidance in traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 471-495, December.
    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. Пигнастый, Олег, 2014. "Основы Статистической Теории Построения Континуальных Моделей Производственных Линий [Fundamentals Of The Statistical Theory Of The Construction Of Continuum Models Of Production Lines]," MPRA Paper 95240, University Library of Munich, Germany, revised 20 Aug 2014.
    2. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2007. "Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1114-1138, December.
    3. 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.
    4. 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.
    5. 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.
    6. Helbing, Dirk & Armbruster, Dieter & Mikhailov, Alexander S. & Lefeber, Erjen, 2006. "Information and material flows in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 363(1), pages 1-1.
    7. Scott Webster & Z. Kevin Weng, 2001. "Improving Repetitive Manufacturing Systems: Model and Insights," Operations Research, INFORMS, vol. 49(1), pages 99-106, February.
    8. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    9. Klug, Florian, 2014. "Modelling and analysis of synchronised material flow with fluid dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 404-417.
    10. Alvarez, Luis & Horowitz, Roberto, 1997. "Safe Platooning In Automated Highway Systems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt1v97t5w1, Institute of Transportation Studies, UC Berkeley.
    11. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    12. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    13. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    14. Pihnastyi, Oleh & Parachnevych, Oksana, 2018. "On the formulation of the problem of optimal control of production parameters using a two-level model of the production process," MPRA Paper 88761, University Library of Munich, Germany, revised 01 Sep 2018.
    15. Jin, Wen-Long, 2009. "Asymptotic traffic dynamics arising in diverge-merge networks with two intermediate links," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 575-595, June.
    16. Ramasesh, Ranga V. & Fu, Haizhen & Fong, Duncan K. H. & Hayya, Jack C., 2000. "Lot streaming in multistage production systems," International Journal of Production Economics, Elsevier, vol. 66(3), pages 199-211, July.
    17. Morikawa, Katsumi & Takahashi, Katsuhiko & Hirotani, Daisuke, 2014. "Make-to-stock policies for a multistage serial system under a make-to-order production environment," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 30-37.
    18. Jin, Wen-Long, 2012. "A kinematic wave theory of multi-commodity network traffic flow," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1000-1022.
    19. Tito Homem-de-Mello & Alexander Shapiro & Mark L. Spearman, 1999. "Finding Optimal Material Release Times Using Simulation-Based Optimization," Management Science, INFORMS, vol. 45(1), pages 86-102, January.
    20. Jahn, Olaf & Möhring, Rolf & Schulz, Andreas & Stier Moses, Nicolás, 2004. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Working papers 4394-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.

    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:comgts:v:7:y:2010:i:1:p:61-83. 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: 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.