Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing

被引:3
|
作者
Yin, Peng-Yeng [1 ,2 ]
Chen, Hsin-Min [2 ]
Cheng, Yi-Lung [3 ]
Wei, Ying-Chieh [2 ]
Huang, Ya-Lin [1 ]
Day, Rong-Fuh [1 ]
机构
[1] Natl Chi Nan Univ, Dept Informat Management, 1 Univ Rd, Nantou 54561, Taiwan
[2] Natl Chi Nan Univ, Inst Strategy & Dev Emerging Ind, 1 Univ Rd, Nantou 54561, Taiwan
[3] Natl Chi Nan Univ, Dept Elect Engn, 1 Univ Rd, Nantou 54561, Taiwan
关键词
flowshop scheduling; circular economy; rubber circular manufacturing; heuristic; genetic algorithm; ECONOMY; ALGORITHM;
D O I
10.3390/su13052576
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
It is estimated that 1 billion waste tires are generated every year across the globe, yet only 10% are being processed, and much rubber waste is yielded during manufacturing. These waste tires and rubber scraps are poisonous to the environment when processed via incineration and landfill. Rubber circular manufacturing is an effective solution that reduces not only rubber waste but also raw material costs. In this paper we propose a two-line flowshop model for the circular rubber manufacturing problem (CRMP), where the job sequence of two production lines is appropriately aligned to obtain the shortest makespan while guaranteeing that sufficient rubber waste yielded in the first line is ready to be reused for circular production in the second line. A genetic algorithm (GA) is developed, and the design of its genetic operations is customized to the CRMP context to achieve efficient and effective evolution. The experimental results with both real and synthetic datasets show that the GA significantly surpasses two heuristics in the literature by delivering the minimum makespan, which is 3.4 to 11.2% shorter than those obtained by the two competing methods.
引用
收藏
页码:1 / 18
页数:18
相关论文
共 50 条
  • [1] A HYBRID APPROACH FOR MINIMIZING MAKESPAN IN PERMUTATION FLOWSHOP SCHEDULING
    Govindan, Kannan
    Balasundaram, R.
    Baskar, N.
    Asokan, P.
    JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2017, 26 (01) : 50 - 76
  • [2] A hybrid approach for minimizing makespan in permutation flowshop scheduling
    Kannan Govindan
    R. Balasundaram
    N. Baskar
    P. Asokan
    Journal of Systems Science and Systems Engineering, 2017, 26 : 50 - 76
  • [3] Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs
    Hirakawa, Yasuhiro
    Ishigaki, Aya
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2011, 10 (02): : 134 - 139
  • [4] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
  • [5] Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
    Ying, Kuo-Ching
    Lin, Shih-Wei
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 92 : 132 - 141
  • [6] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
  • [7] Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem
    Mansouri, S. Afshin
    Aktas, Emel
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (11) : 1382 - 1394
  • [9] Minimizing makespan in a two-machine flowshop scheduling with batching and release time
    Tang, Lixin
    Liu, Peng
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (5-6) : 1071 - 1077
  • [10] An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion
    Zhao, Fuqing
    Zhao, Lexi
    Wang, Ling
    Song, Houbin
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160