Skip to main content

Advertisement

SpringerLink
Log in

Collaborative optimization of workshop layout and scheduling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

The collaborative optimization of workshop layout and scheduling is key to realizing the efficient and orderly operation of manufacturing systems. To satisfy the low-entropy development mode and the urgent need for secondary development of enterprises, this study investigates the issue of collaborative optimization of workshop layout and scheduling by coupling and integrating their internal linkage. The low-entropy indexes of collaborative optimization of workshop layout and scheduling were analyzed, and the makespan, processing quality loss, and production cost were considered to be the optimization objectives. Accordingly, a low-entropy collaborative mathematical model of workshop layout and scheduling was constructed. Based on a multi-objective genetic algorithm for differential cell processes, an agent structure was introduced, and a new mutation strategy was designed. Considering the environmental disturbance factors, an agent cellular automata and differential evolution (ACADE) algorithm was proposed for solving the layout and scheduling coordination. Moreover, a case study was conducted, which provided basic theoretical methods and technical support for the coordinated optimization of workshop layout and scheduling.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Aarts, E. H. L., & Lenstra, J. K. (eds). (1997). Local Search in Combinatorial Optimization. John Wiley & Sons Ltd.

  • Abdullah, S., & Abdolrazzagh-Nezhad, M. (2014). Fuzzy job-shop scheduling problems: A review. Information Sciences, 278, 380–407.

    Article  Google Scholar 

  • Akbari Jokar, M. R., & Shoja Sangchooli, A. (2010). Constructing a block layout by face area. The International Journal of Advanced Manufacturing Technology, 54(5–8), 801–809.

    Google Scholar 

  • Amaral, A. R. S. (2018). A mixed-integer programming formulation for the double row layout of machines in manufacturing systems. International Journal of Production Research, pp. 1–14.

  • Arkat, J., Farahani, M. H., & Ahmadizar, F. (2012). Multi-objective genetic algorithm for cell formation problem considering cellular layout and operations scheduling. International Journal of Computer Integrated Manufacturing, 25(7), 625–635.

    Article  Google Scholar 

  • Baykasoğlu, A., & Gindy, N. N. Z. (2001). A simulated annealing algorithm for dynamic layout problem. Computers & Operations Research, 28(14), 1403–1426. https://doi.org/10.1016/s0305-0548(00)00049-6

    Article  Google Scholar 

  • Behnamian, J. (2016). Survey on fuzzy shop scheduling. Fuzzy Optimization and Decision Making, 15(3), 331–366.

    Article  Google Scholar 

  • Beigy, H., & Meybodi, M. R. (2004). A mathematical framework for cellular learning automata. Advances in Complex Systems, 07, 295–319.

    Article  Google Scholar 

  • Benttaleb, M., Hnaien, F., & Yalaoui, F. (2018). Two-machine job shop problem under availability constraints on one machine: Makespan minimization. Computers & Industrial Engineering, 117, 138–151.

    Article  Google Scholar 

  • Chaudhry, I. A., & Khan, A. A. (2015). A research survey: Review of flexible job shop scheduling techniques. International Transactions in Operational Research, 23(3), 551–591.

    Article  Google Scholar 

  • Davis, L. (1985). Job Shop Scheduling with Genetic Algorithms. In Proceedings of the 1st International Conference on Genetic Algorithms, 136–140.

  • Derakhshan Asl, A., & Wong, K. Y. (2015). Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization. Journal of Intelligent Manufacturing, 28(6), 1317–1336.

    Article  Google Scholar 

  • Dunker, T., Radons, G., & Westkämper, E. (2005). Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. European Journal of Operational Research, 165(1), 55–69.

    Article  Google Scholar 

  • Durillo, J. J., Nebro, A. J., Luna, F., & Alba, E. (2008). Solving Three-Objective Optimization Problems Using a New Hybrid Cellular Genetic Algorithm. In Proceedings of the 10th International Conference on Parallel Problem Solving from Nature --- PPSN X, 5199. 661–670.

  • Ebrahimi, A., Kia, R., & Komijan, A. R. (2016). Solving a mathematical model integrating unequal-area facilities layout and part scheduling in a cellular manufacturing system by a genetic algorithm. Springerplus, 5(1), 1254–1282.

    Article  Google Scholar 

  • Ebrahimi, A., Woo Jeon, H., Lee, S., & Wang, C. (2020). Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: A comparison of four metaheuristic algorithms. Computers & Industrial Engineering, 53(2), 106295–106315.

    Article  Google Scholar 

  • Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.

    Article  Google Scholar 

  • Gomes, M. C., Barbosa-Póvoa, A. P., & Novais, A. Q. (2005). Optimal scheduling for flexible job shop operation. International Journal of Production Research, 43(11), 2323–2353.

    Article  Google Scholar 

  • Güçdemir, H., & Selim, H. (2017). Customer centric production planning and control in job shops: A simulation optimization approach. Journal of Manufacturing Systems, 43, 100–116.

    Article  Google Scholar 

  • Hammad, A. W. A., Rey, D., & Akbarnezhad, A. (2017). A cutting plane algorithm for the site layout planning problem with travel barriers. Computers & Operations Research, 82, 36–51. https://doi.org/10.1016/j.cor.2017.01.005

    Article  Google Scholar 

  • Hariri, A. M. A., & Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103(3), 547–556.

    Article  Google Scholar 

  • Hernández-Gress, E. S., Seck-Tuoh-Mora, J. C., Hernández-Romero, N., Medina-Marín, J., Lagos-Eulogio, P., & Ortíz-Perea, J. (2020). The solution of the concurrent layout and scheduling problem in the job-shop environment through a local neighborhood search algorithm. Expert Systems with Applications, 144, 113096.

    Article  Google Scholar 

  • Hou, S., Wen, H., Feng, S., Wang, H., & Li, Z. (2019). Application of Layered Coding Genetic Algorithm in Optimization of Unequal Area Production Facilities Layout. Computational Intelligence and Neuroscience, pp. 1–17.

  • Ingimundardottir, H., & Runarsson, T. P. (2011). Supervised learning linear priority dispatch rules for job-shop scheduling. International Conference on Learning and Intelligent Optimization. Springer, pp. 263–277.

  • Jiang, T., Gu, J., Zhu, H., & Zhang, C. (2019). Low-carbon job shop scheduling problem with discrete genetic-grey wolf optimization algorithm. Journal of Advanced Manufacturing Systems, 19(1), 1–14.

    Google Scholar 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.

    Article  Google Scholar 

  • Kamoshida, R. (2018). Concurrent optimization of job shop scheduling and dynamic and flexible facility layout planning. 2018 5th International Conference on Industrial Engineering and Applications (ICIEA), pp. 289–293.

  • Klausnitzer, A., & Lasch, R. (2018). Optimal facility layout and material handling network design. Computers & Operations Research, 103, 237–251.

    Article  Google Scholar 

  • Lacksonen, T. A., & Hung, C.-Y. (1998). Project scheduling algorithms for re-layout projects. IIE Transactions, 30(1), 91–99.

    Article  Google Scholar 

  • Li, B., Zhao, Z. Y., & Li, G. (2005). A dynamic scheduling method for spatial layout planning. 2005 International Conference on Machine Learning and Cybernetics, 6, 3612–3617.

  • Liu, Q., & Zhao, H. (2017). Integrated optimization of workshop layout and scheduling to reduce carbon emissions based on a multi-objective fruit fly optimization algorithm. Journal of Mechanical Engineering, 53, 122–133.

    Article  Google Scholar 

  • Liu, S. Q., & Kozan, E. (2012). A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem. Journal of the Operational Research Society, 63(2), 168–182.

    Article  Google Scholar 

  • Mallikarjuna, K., Veeranna, V., & Reddy, K. H. (2016). A new meta-heuristics for optimum design of loop layout in flexible manufacturing system with integrated scheduling. The International Journal of Advanced Manufacturing Technology, 84, 1841–1860.

    Article  Google Scholar 

  • Mitrokhin, Y. (2014). Two faces of entropy and information in biological systems. Journal of Theoretical Biology, 359, 192–198.

    Article  Google Scholar 

  • Morinaga, E., Wakamatsu, H., Iwasaki, K., & Arai, E. (2016). A facility layout planning method considering routing and temporal efficiency. International Symposium on Flexible Automation (ISFA), 2016, 186–191.

    Article  Google Scholar 

  • Moursli, O., & Pochet, Y. (2000). A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics, 64(1–3), 113–125.

    Article  Google Scholar 

  • Ning, T., Huang, M., Liang, X., & Jin, H. (2016). A novel dynamic scheduling strategy for solving flexible job-shop problems. Journal of Ambient Intelligence and Humanized Computing, 7(5), 721–729.

    Article  Google Scholar 

  • Petrovic, D. (2001). Simulation of supply chain behaviour and performance in an uncertain environment. International Journal of Production Economics, 71(1–3), 429–438.

    Article  Google Scholar 

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35(10), 3202–3212.

    Article  Google Scholar 

  • Piroozfard, H., Wong, K. Y., & Asl, A. D. (2015). A Hybrid Harmony Search Algorithm for the Job Shop Scheduling Problems. 2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA), pp. 48–52.

  • Ranjbar, M., & Razavi, M. N. (2012). A hybrid metaheuristic for concurrent layout and scheduling problem in a job shop environment. The International Journal of Advanced Manufacturing Technology, 62(9–12), 1249–1260.

    Article  Google Scholar 

  • Ripon, K. S. N., Glette, K., Hovin, M., & Torresen, J. (2012). A multi-objective evolutionary algorithm for solving integrated scheduling and layout planning problems in manufacturing systems. In Proceedings of the 2012 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS 2012), Madrid, pp. 157–163.

  • Ripon, K. S. N., & Torresen, J. (2014). Integrated job shop scheduling and layout planning: A hybrid evolutionary method for optimizing multiple objectives. Evolving Systems, 5, 121–132.

    Article  Google Scholar 

  • Şahinkoç, M., & Bilge, Ü. (2018). Facility layout problem with QAP formulation under scenario-based uncertainty. INFOR: Information Systems and Operational Research, pp. 1–22.

  • Sharma, P., & Jain, A. (2014). A review on job shop scheduling with setup times. Proceedings of the Institution of Mechanical Engineers, Part b: Journal of Engineering Manufacture, 230(3), 517–533.

    Article  Google Scholar 

  • Sharma, P., & Singhal, S. (2016). Implementation of fuzzy TOPSIS methodology in selection of procedural approach for facility layout planning. The International Journal of Advanced Manufacturing Technology, 88(5–8), 1485–1493.

    Google Scholar 

  • Ünal, A. T., Ağralı, S., & Taşkın, Z. C. (2019). A strong integer programming formulation for hybrid flowshop scheduling. Journal of the Operational Research Society, pp. 1–11.

  • Vilcot, G., & Billaut, J.-C. (2011). A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. International Journal of Production Research, 49(23), 6963–6980.

    Article  Google Scholar 

  • Wang, C., & Jiang, P. (2018). Manifold learning based rescheduling decision mechanism for recessive disturbances in RFID-driven job shops. Journal of Intelligent Manufacturing, 29, 1485–1500.

    Article  Google Scholar 

  • Wang, W., & Brunn, P. (2000). An effective genetic algorithm for job shop scheduling. Proceedings of the Institution of Mechanical Engineers, Part b: Journal of Engineering Manufacture, 214(4), 293–300.

    Article  Google Scholar 

  • Wolfram, S. (2002). A New Kind of Science. Wolfram Media

  • Wolfram, S. (1984). Cellular automata: A model of complexity. Nature, 31, 419–424.

    Article  Google Scholar 

  • Wong, K. Y., & Komarudin. (2010). Solving facility layout problems using flexible bay structure representation and ant system algorithm. Expert Systems with Applications, 37(7), 5523–5527.

    Article  Google Scholar 

  • Wu, X., Chu, C.-H., Wang, Y., & Yue, D. (2007). Genetic algorithms for integrating cell formation with machine layout and scheduling. Computers & Industrial Engineering, 53(2), 277–289.

    Article  Google Scholar 

  • Xanthopoulos, A. S., & Koulouriotis, D. E. (2015). Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing. Journal of Intelligent Manufacturing, 29(1), 69–91.

    Article  Google Scholar 

  • Xie, W., & Sahinidis, N. V. (2008). A branch-and-bound algorithm for the continuous facility layout problem. Computers & Chemical Engineering, 32(4–5), 1016–1028.

    Article  Google Scholar 

  • Yalaoui, N., Mahdi, H., Amodeo, L., & Yalaoui, F. (2009). A new approach for workshop design. Journal of Intelligent Manufacturing, 22(6), 933–951.

    Article  Google Scholar 

  • Yang, C.-L., Chuang, S.-P., & Hsu, T.-S. (2010). A genetic algorithm for dynamic facility planning in job shop manufacturing. The International Journal of Advanced Manufacturing Technology, 52(1–4), 303–309.

    Google Scholar 

  • Yang, X., Cheng, W., Guo, P., & He, Q. (2019). Mixed integer programming formulations for single row facility layout problems with asymmetric material flow and corridor width. Arabian Journal for Science and Engineering, 44(8), 7261–7276.

    Article  Google Scholar 

  • Zandieh, M., Khatami, A. R., & Rahmati, S. H. A. (2017). Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm. Applied Soft Computing, 58, 449–464.

    Article  Google Scholar 

  • Zhang, H. L., Ge, H. J., Pan, R. L., & Wu, Y. J. (2018). Multi-objective bi-level programming for the energy-aware integration of flexible job shop scheduling and multi-row layout. Algorithms, 11(12), 210–235.

    Article  Google Scholar 

  • Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019). Review of job shop scheduling research and its new perspectives under Industry 4. 0. Journal of Intelligent Manufacturing, 30(4), 1809–1830.

    Article  Google Scholar 

  • Zhou, J., Love, P. E. D., Teo, K. L., & Luo, H. (2016). An exact penalty function method for optimising QAP formulation in facility layout problem. International Journal of Production Research, 55(10), 2913–2929.

    Article  Google Scholar 

  • Zhu, X., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38, 987–1007.

    Article  Google Scholar 

Download references

Acknowledgements

The work was supported by the Natural Science Foundation of Zhejiang Province of China under No. LY16G010013 and the National High-Tech R&D Program of China under No. 2015AA043002.

Author information

Authors and Affiliations

  1. College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou, 310023, China

    Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao & Shousong Jin

  2. Key Laboratory of Special Purpose Equipment and Advanced Processing Technology, Ministry of Education, Zhejiang University of Technology, Hangzhou, 310023, China

    Yaliang Wang & Shousong Jin

Authors
  1. Yaliang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinyu Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chendi Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kanghong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shousong Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shousong Jin.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Fan, X., Ni, C. et al. Collaborative optimization of workshop layout and scheduling. J Sched 26, 43–59 (2023). https://doi.org/10.1007/s10951-022-00761-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-022-00761-7

Keywords

Search

Navigation