IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v27y2016i1d10.1007_s10845-014-0890-y.html
   My bibliography  Save this article

A survey of multi-factory scheduling

Author

Listed:
  • J. Behnamian

    (Bu-Ali Sina University)

  • S. M. T. Fatemi Ghomi

    (Amirkabir University of Technology)

Abstract

Because of current globalization trend, production has shifted from the single factory production to multi-factory production network. To become competitive in today’s rapidly changing market requirements, factories have shifted from a centralized to a more decentralized structure, in many areas of decision making including scheduling. In multi-factory production network, each factory can be considered as an individual entity which has different efficiency and is subject to different constraints, for example, machine advances, worker cost, tax, close to suppliers, and transportation facilities, etc. Since limited resources make scheduling an important decision in the production, for several decades, researchers focused on determining an efficient schedule to improve the productivity. The recent remarkable attention in distributed production management in both academia and the industry has demonstrated the significance of multi-factory scheduling. For the first time, this paper provides a review on the multi-factory machine scheduling. For this, first, the paper classifies and reviews the literature according to shop environments, including single machine, parallel machines, flowshop, job shop, and open shop. Then the reviewed literature is quantified and measured. At the end, the paper concludes by presenting some problems receiving less attention than the others and proposes several research opportunities in the field.

Suggested Citation

  • J. Behnamian & S. M. T. Fatemi Ghomi, 2016. "A survey of multi-factory scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(1), pages 231-249, February.
  • Handle: RePEc:spr:joinma:v:27:y:2016:i:1:d:10.1007_s10845-014-0890-y
    DOI: 10.1007/s10845-014-0890-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-014-0890-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-014-0890-y?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. Dessouky, Maged M. & Dessouky, Mohamed I. & Verma, Sushil K., 1998. "Flowshop scheduling with identical jobs and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 109(3), pages 620-631, September.
    2. Chung, S.H. & Lau, H.C.W. & Choy, K.L. & Ho, G.T.S. & Tse, Y.K., 2010. "Application of genetic approach for advanced planning in multi-factory environment," International Journal of Production Economics, Elsevier, vol. 127(2), pages 300-308, October.
    3. Mellouli, Racem & Sadfi, Chrif & Chu, Chengbin & Kacem, Imed, 2009. "Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1150-1165, September.
    4. Jyi-Shane Liu & Katia Sycara, 1997. "Coordination of multiple agents for production management," Annals of Operations Research, Springer, vol. 75(0), pages 235-289, January.
    5. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    6. Fred M. Westfield, 1955. "Marginal Analysis, Multi-Plant Firms, and Business Practice: An Example," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 69(2), pages 253-268.
    7. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
    8. Dennis E. Blumenfeld & Lawrence D. Burns & Carlos F. Daganzo & Michael C. Frick & Randolph W. Hall, 1987. "Reducing Logistics Costs at General Motors," Interfaces, INFORMS, vol. 17(1), pages 26-47, February.
    9. Gnoni, M. G. & Iavagnilio, R. & Mossa, G. & Mummolo, G. & Di Leva, A., 2003. "Production planning of a multi-site manufacturing system by hybrid modelling: A case study from the automotive industry," International Journal of Production Economics, Elsevier, vol. 85(2), pages 251-262, August.
    10. Guinet, Alain, 2001. "Multi-site planning: A transshipment problem," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 21-32, December.
    11. De Giovanni, L. & Pezzella, F., 2010. "An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 395-408, January.
    12. Timpe, Christian H. & Kallrath, Josef, 2000. "Optimal planning in large multi-site production networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 422-435, October.
    13. VAN ROY, Tony J., 1983. "Cross decomposition for mixed integer programming," LIDAM Reprints CORE 496, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    15. Naso, David & Surico, Michele & Turchiano, Biagio & Kaymak, Uzay, 2007. "Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2069-2099, March.
    16. Ruiz-Torres, Alex J. & Lopez, Francisco J. & Ho, Johnny C., 2007. "Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 179(2), pages 302-315, June.
    17. Rodríguez Monroy, Carlos & Vilana Arto, José Ramón, 2010. "Analysis of global manufacturing virtual networks in the aeronautical industry," International Journal of Production Economics, Elsevier, vol. 126(2), pages 314-323, August.
    18. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    19. Tuma, A., 1998. "Configuration and coordination of virtual production networks," International Journal of Production Economics, Elsevier, vol. 56(1), pages 641-648, September.
    20. Jack F. Williams, 1981. "Heuristic Techniques for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures: Theory and Empirical Comparisons," Management Science, INFORMS, vol. 27(3), pages 336-352, March.
    21. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, 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. Julio Mar-Ortiz & Alex J. Ruiz Torres & Belarmino Adenso-Díaz, 2022. "Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier," Operational Research, Springer, vol. 22(4), pages 4585-4605, September.
    2. Symeon Mavridis, 2018. "Greece’s Economic and Social Transformation 2008–2017," Social Sciences, MDPI, vol. 7(1), pages 1-14, January.
    3. Ivan Kristianto Singgih & Onyu Yu & Byung-In Kim & Jeongin Koo & Seungdoe Lee, 2020. "Production scheduling problem in a factory of automobile component primer painting," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1483-1496, August.
    4. Ali Gharaei & Fariborz Jolai, 2021. "A Pareto approach for the multi-factory supply chain scheduling and distribution problem," Operational Research, Springer, vol. 21(4), pages 2333-2364, December.
    5. Seyed Ahmad Razavi Al-e-hashem & Ali Papi & Mir Saman Pishvaee & Mohammadreza Rasouli, 2022. "Robust maintenance planning and scheduling for multi-factory production networks considering disruption cost: a bi-objective optimization model and a metaheuristic solution method," Operational Research, Springer, vol. 22(5), pages 4999-5034, November.
    6. Neufeld, Janis S. & Schulz, Sven & Buscher, Udo, 2023. "A systematic review of multi-objective hybrid flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 309(1), pages 1-23.
    7. Perkiss, Stephanie & Bernardi, Cristiana & Dumay, John & Haslam, Jim, 2021. "A sticky chocolate problem: Impression management and counter accounts in the shaping of corporate image," CRITICAL PERSPECTIVES ON ACCOUNTING, Elsevier, vol. 81(C).
    8. Jafar-Zanjani, Hamed & Zandieh, Mostafa & Sharifi, Mani, 2022. "Robust and resilient joint periodic maintenance planning and scheduling in a multi-factory network under uncertainty: A case study," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    9. Li, Yantong & Côté, Jean-François & Coelho, Leandro C. & Zhang, Chuang & Zhang, Shuai, 2023. "Order assignment and scheduling under processing and distribution time uncertainty," European Journal of Operational Research, Elsevier, vol. 305(1), pages 148-163.
    10. Mohammed Haoues & Mohammed Dahane & Nadia Kenza Mouss, 2019. "Outsourcing optimization in two-echelon supply chain network under integrated production-maintenance constraints," Journal of Intelligent Manufacturing, Springer, vol. 30(2), pages 701-725, February.
    11. Ruiz, Rubén & Pan, Quan-Ke & Naderi, Bahman, 2019. "Iterated Greedy methods for the distributed permutation flowshop scheduling problem," Omega, Elsevier, vol. 83(C), pages 213-222.

    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. Sun, X.T. & Chung, S.H. & Chan, Felix T.S., 2015. "Integrated scheduling of a multi-product multi-factory manufacturing system with maritime transport limits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 110-127.
    2. Tsai, Kune-muh & Wang, Shan-chi, 2009. "Multi-site available-to-promise modeling for assemble-to-order manufacturing: An illustration on TFT-LCD manufacturing," International Journal of Production Economics, Elsevier, vol. 117(1), pages 174-184, January.
    3. Seyed Ahmad Razavi Al-e-hashem & Ali Papi & Mir Saman Pishvaee & Mohammadreza Rasouli, 2022. "Robust maintenance planning and scheduling for multi-factory production networks considering disruption cost: a bi-objective optimization model and a metaheuristic solution method," Operational Research, Springer, vol. 22(5), pages 4999-5034, November.
    4. Ali Gharaei & Fariborz Jolai, 2021. "A Pareto approach for the multi-factory supply chain scheduling and distribution problem," Operational Research, Springer, vol. 21(4), pages 2333-2364, December.
    5. 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.
    6. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    7. Waldherr, Stefan & Knust, Sigrid, 2017. "Decomposition algorithms for synchronous flow shop problems with additional resources and setup times," European Journal of Operational Research, Elsevier, vol. 259(3), pages 847-863.
    8. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    9. Arshad Ali & Yuvraj Gajpal & Tarek Y. Elmekkawy, 2021. "Distributed permutation flowshop scheduling problem with total completion time objective," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 425-447, June.
    10. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    11. Mansouri, S. Afshin & Aktas, Emel & Besikci, Umut, 2016. "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption," European Journal of Operational Research, Elsevier, vol. 248(3), pages 772-788.
    12. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    13. Sun, X.T. & Chung, S.H. & Chan, Felix T.S. & Wang, Zheng, 2018. "The impact of liner shipping unreliability on the production–distribution scheduling of a decentralized manufacturing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 242-269.
    14. Ciavotta, Michele & Minella, Gerardo & Ruiz, Rubén, 2013. "Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study," European Journal of Operational Research, Elsevier, vol. 227(2), pages 301-313.
    15. Chevroton, Hugo & Kergosien, Yannick & Berghman, Lotte & Billaut, Jean-Charles, 2021. "Solving an integrated scheduling and routing problem with inventory, routing and penalty costs," European Journal of Operational Research, Elsevier, vol. 294(2), pages 571-589.
    16. Xiong, Fuli & Xing, Keyi & Wang, Feng, 2015. "Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 240(2), pages 338-354.
    17. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    18. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    19. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    20. S Afshin Mansouri & Emel Aktas, 2016. "Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1382-1394, November.

    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:joinma:v:27:y:2016:i:1:d:10.1007_s10845-014-0890-y. 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.