Variable Neighborhood based Memetic Algorithm for Just-in-Time Distributed Assembly Permutation Flowshop Scheduling

被引：0
|
作者：
Wang, Keyao [1 ]
Li, Zhengyang [2 ,3 ]
Duan, Wenzhe [2 ,3 ]
Feng, Xiaoyi [2 ,3 ]
Liu, Bo [2 ,3 ]
机构：
[1] Beihang Univ, Astronaut Sch, Beijing 100191, Peoples R China
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[3] Univ Chinese Acad Sci, Beijing, Peoples R China
来源：
2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC) | 2017年
关键词：
Corridor window; Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP); Just-in-Time (JIT); maximum earliness/tardiness cost; Memetic Algorithm (MA); Variable Neighborhood Search (VNS); SEARCH; HEURISTICS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) represents a widely-applied manufacturing pattern, which is formed by two relatively independent stages, i.e., processing stage and assembly stage. In this paper, we introduce the Just-in-Time (JIT) constraint between the two stages of the conventional DAPFSP to form the Just-in-Time DAPFSP (JIT-DAPFSP), with respect to minimizing the maximum weighted earliness/tardiness cost. A variable neighborhood search based Memetic Algorithm (VNSMA) is proposed by incorporating several novel neighborhoods manipulating the factory assignment. Computational tests are carried out on 10 small-scale and 5 large-scale benchmark problems to compare the results of different operators and algorithms. To the best of our knowledge, this is the first report to model JIT constraints and objective in DAPFSP.
引用
收藏
页码：3700 / 3704
页数：5
相关论文
共 50 条
  • [31] An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem
    Song, Hong-Bo
    Yang, You-Hong
    Lin, Jian
    Ye, Jing-Xuan
    APPLIED SOFT COMPUTING, 2023, 135
  • [32] A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem
    Zheng, Jianguo
    Wang, Yilin
    APPLIED SCIENCES-BASEL, 2021, 11 (21):
  • [33] Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem
    Chen, Rong-Chang
    Chen, Jeanne
    Chen, Tung-Shou
    Huang, Chien-Che
    Chen, Li-Chiu
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
  • [34] An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
    Gao, Jian
    Chen, Rong
    Deng, Wu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (03) : 641 - 651
  • [35] Chemical reaction optimization algorithm for the distributed permutation flowshop scheduling problem
    Shen, Jingnan
    Wang, Ling
    Wang, Shengyao
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2015, 55 (11): : 1184 - 1189
  • [36] An iterated local search algorithm for distributed assembly permutation flowshop problem
    Huang, Ying-Ying
    Pan, Quan-ke
    Hu, XiaoLu
    Tasgetiren, M. Fatih
    Huang, Jiang-ping
    PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 1548 - 1552
  • [37] A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem
    Kurdi, Mohamed
    APPLIED SOFT COMPUTING, 2020, 94
  • [38] Distributed permutation flowshop scheduling problem with total completion time objective
    Ali, Arshad
    Gajpal, Yuvraj
    Elmekkawy, Tarek Y.
    OPSEARCH, 2021, 58 (02) : 425 - 447
  • [39] Research of Just-in-time Scheduling for Assembly Job Shop
    Lü H.
    Zhu J.
    Wang Z.
    Wu S.
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2021, 57 (05): : 157 - 165
  • [40] Scheduling the replenishment of just-in-time supermarkets in assembly plants
    Emde, Simon
    OR SPECTRUM, 2017, 39 (01) : 321 - 345
12345