IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v26y2023i1d10.1007_s10951-022-00761-7.html
   My bibliography  Save this article

Collaborative optimization of workshop layout and scheduling

Author

Listed:
  • Yaliang Wang

    (Zhejiang University of Technology
    Zhejiang University of Technology)

  • Xinyu Fan

    (Zhejiang University of Technology)

  • Chendi Ni

    (Zhejiang University of Technology)

  • Kanghong Gao

    (Zhejiang University of Technology)

  • Shousong Jin

    (Zhejiang University of Technology
    Zhejiang University of Technology)

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.

Suggested Citation

  • Yaliang Wang & Xinyu Fan & Chendi Ni & Kanghong Gao & Shousong Jin, 2023. "Collaborative optimization of workshop layout and scheduling," Journal of Scheduling, Springer, vol. 26(1), pages 43-59, February.
    • Handle: RePEc:spr:jsched:v:26:y:2023:i:1:d:10.1007_s10951-022-00761-7
    DOI: 10.1007/s10951-022-00761-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00761-7
    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/s10951-022-00761-7?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. S Q Liu & E Kozan, 2012. "A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 168-182, February.
    2. Hamid Beigy & M. R. Meybodi, 2004. "A Mathematical Framework For Cellular Learning Automata," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 7(03n04), pages 295-319.
    3. J. Behnamian, 2016. "Survey on fuzzy shop scheduling," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 331-366, September.
    4. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    5. Petrovic, Dobrila, 2001. "Simulation of supply chain behaviour and performance in an uncertain environment," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 429-438, May.
    6. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    7. Dunker, Thomas & Radons, Gunter & Westkamper, Engelbert, 2005. "Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 55-69, August.
    8. Chuang Wang & Pingyu Jiang, 2018. "Manifold learning based rescheduling decision mechanism for recessive disturbances in RFID-driven job shops," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1485-1500, October.
    9. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    10. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    11. 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, Elsevier, vol. 103(3), pages 547-556, 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. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
    2. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    3. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    4. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    5. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    6. Zongxu Mu & Minming Li, 2015. "DVS scheduling in a line or a star network of processors," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 16-35, January.
    7. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    8. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    9. A.A. Gladky & Y.M. Shafransky & V.A. Strusevich, 2004. "Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 13-28, March.
    10. Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang, 2022. "Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 571-588, April.
    11. Rossit, Daniel A. & Vásquez, Óscar C. & Tohmé, Fernando & Frutos, Mariano & Safe, Martín D., 2021. "A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 289(3), pages 841-854.
    12. Ming Zhang & Yang Lu & Youxi Hu & Nasser Amaitik & Yuchun Xu, 2022. "Dynamic Scheduling Method for Job-Shop Manufacturing Systems by Deep Reinforcement Learning with Proximal Policy Optimization," Sustainability, MDPI, vol. 14(9), pages 1-16, April.
    13. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    14. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    15. Jianming Dong & Yong Chen & An Zhang & Qifan Yang, 2013. "A new three-machine shop scheduling: complexity and approximation algorithm," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 799-810, November.
    16. James Blocher & Dilip Chhajed, 2008. "Minimizing customer order lead-time in a two-stage assembly supply chain," Annals of Operations Research, Springer, vol. 161(1), pages 25-52, July.
    17. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    18. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    19. Thierry Garaix & Salim Rostami & Xiaolan Xie, 2020. "Daily outpatient chemotherapy appointment scheduling with random deferrals," Flexible Services and Manufacturing Journal, Springer, vol. 32(1), pages 129-153, March.
    20. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.

    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:jsched:v:26:y:2023:i:1:d:10.1007_s10951-022-00761-7. 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.