IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v55y2009i2p267-280.html
   My bibliography  Save this article

Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing/Warehouse Facility

Author

Listed:
  • Min Zhang

    (Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, New York 14260)

  • Rajan Batta

    (Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, New York 14260)

  • Rakesh Nagi

    (Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, New York 14260)

Abstract

This paper discusses the notion of workflow congestion in the context of material handling equipment interruptions in a manufacturing or warehousing facility. Development of a combination of probabilistic and physics-based models for workflow interruptions permits evaluation of the expected link travel time. The problem is then of routing in a way that minimizes total expected travel time. The rerouting problem is modeled as a multicommodity flow problem with link capacity design. A greedy upper bounding and Lagrangean relaxation algorithm are developed to solve this efficiently. To calibrate our modeling process we develop an object-oriented simulation model that explicitly considers various workflow interruptions. Our major finding is that rerouting traffic in a congested facility can significantly alleviate congestion delays and improve the efficiency of material movement. A managerial insight derived from this work is that rerouting is most effective in medium traffic-intensity situations.

Suggested Citation

  • Min Zhang & Rajan Batta & Rakesh Nagi, 2009. "Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing/Warehouse Facility," Management Science, INFORMS, vol. 55(2), pages 267-280, February.
    • Handle: RePEc:inm:ormnsc:v:55:y:2009:i:2:p:267-280
    DOI: 10.1287/mnsc.1080.0916
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1080.0916
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1080.0916?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
    ---><---

    References listed on IDEAS

    as
    1. J. Macgregor Smith & Wu-Ji Li, 2001. "Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 421-443, December.
    2. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    3. John J. Bartholdi & Kevin R. Gue, 2000. "Reducing Labor Costs in an LTL Crossdocking Terminal," Operations Research, INFORMS, vol. 48(6), pages 823-832, December.
    4. Saifallah Benjaafar, 2002. "Modeling and Analysis of Congestion in the Design of Facility Layouts," Management Science, INFORMS, vol. 48(5), pages 679-704, May.
    5. Nirup N. Krishnamurthy & Rajan Batta & Mark H. Karwan, 1993. "Developing Conflict-Free Routes for Automated Guided Vehicles," Operations Research, INFORMS, vol. 41(6), pages 1077-1090, December.
    6. Chiang, Wen-Chyuan & Kouvelis, Panagiotis & Urban, Timothy L., 2006. "Single- and multi-objective facility layout with workflow interference considerations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1414-1426, November.
    7. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    8. Wen-Chyuan Chiang & Panagiotis Kouvelis & Timothy L. Urban, 2002. "Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem," Management Science, INFORMS, vol. 48(4), pages 584-590, April.
    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. Albareda-Sambola, Maria & Landete, Mercedes & Monge, Juan F. & Sainz-Pardo, José L., 2023. "An exact approach for the reliable fixed-charge location problem with capacity constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 24-35.
    2. Hong, Soondo & Johnson, Andrew L. & Peters, Brett A., 2012. "Batch picking in narrow-aisle order picking systems with consideration for picker blocking," European Journal of Operational Research, Elsevier, vol. 221(3), pages 557-570.
    3. Ferrara, Andrea & Gebennini, Elisa & Grassi, Andrea, 2014. "Fleet sizing of laser guided vehicles and pallet shuttles in automated warehouses," International Journal of Production Economics, Elsevier, vol. 157(C), pages 7-14.
    4. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    5. Maximilian Löffler & Michael Schneider & Ivan Žulj, 2023. "Cost-neutral reduction of infection risk in picker-to-parts warehousing systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 151-179, March.
    6. Halawa, Farouq & Dauod, Husam & Lee, In Gyu & Li, Yinglei & Yoon, Sang Won & Chung, Sung Hoon, 2020. "Introduction of a real time location system to enhance the warehouse safety and operational efficiency," International Journal of Production Economics, Elsevier, vol. 224(C).
    7. Zhen, Lu & Xu, Zhou & Wang, Kai & Ding, Yi, 2016. "Multi-period yard template planning in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 700-719.
    8. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2017. "Linear Reformulation of Polynomial Discrete Programming for Fast Computation," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 108-122, February.
    9. Aida Saez-Mas & Julio J. Garcia-Sabater & Jose P. Garcia-Sabater & Julien Maheut, 2020. "Hybrid approach of discrete event simulation integrated with location search algorithm in a cells assignment problem: a case study," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 125-142, March.
    10. Pottel, Steffen & Goel, Asvin, 2022. "Scheduling activities with time-dependent durations and resource consumptions," European Journal of Operational Research, Elsevier, vol. 301(2), pages 445-457.

    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. Chiang, Wen-Chyuan & Kouvelis, Panagiotis & Urban, Timothy L., 2006. "Single- and multi-objective facility layout with workflow interference considerations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1414-1426, November.
    2. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    3. Asef-Vaziri, Ardavan & Kazemi, Morteza & Eshghi, Kourosh & Lahmar, Maher, 2010. "An ant colony system for enhanced loop-based aisle-network design," European Journal of Operational Research, Elsevier, vol. 207(1), pages 110-120, November.
    4. Jenny Nossack & Dirk Briskorn & Erwin Pesch, 2018. "Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal," Transportation Science, INFORMS, vol. 52(5), pages 1059-1076, October.
    5. Boysen, Nils & Briskorn, Dirk & Fedtke, Stefan & Schmickerath, Marcel, 2019. "Automated sortation conveyors: A survey from an operational research perspective," European Journal of Operational Research, Elsevier, vol. 276(3), pages 796-815.
    6. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    7. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.
    8. Haiqing Song & Vernon N. Hsu & Raymond K. Cheung, 2008. "Distribution Coordination Between Suppliers and Customers with a Consolidation Center," Operations Research, INFORMS, vol. 56(5), pages 1264-1277, October.
    9. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    10. Caroline Lloyd & Jonathan Payne, 2021. "Fewer jobs, better jobs? An international comparative study of robots and ‘routine’ work in the public sector," Industrial Relations Journal, Wiley Blackwell, vol. 52(2), pages 109-124, March.
    11. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    12. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    13. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    14. S Bilgin & M Azizoǧlu, 2006. "Capacity and tool allocation problem in flexible manufacturing systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 670-681, June.
    15. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    16. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
    17. Park, Moon-Won & Kim, Yeong-Dae, 2000. "A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints," European Journal of Operational Research, Elsevier, vol. 123(3), pages 504-518, June.
    18. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    19. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.
    20. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).

    More about this item

    Keywords

    facility design; workflow congestion;

    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:inm:ormnsc:v:55:y:2009:i:2:p:267-280. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.