Filtered Beam Search based Flexible Job Shop Scheduling Problem with Transportation Time

被引：1
|
作者：
Wang, Shijin [1 ]
机构：
[1] Tongji Univ Shanghai, Sch Econ & Management, Dept Management Sci & Engn, Shanghai, Peoples R China
来源：
MANUFACTURING SCIENCE AND ENGINEERING, PTS 1-5 | 2010年 / 97-101卷
关键词：
flexible job shop scheduling; transportation time; material handling device (MHD); filtered beam search; MACHINES; OPTIMIZATION; ALGORITHM;
D O I：
10.4028/www.scientific.net/AMR.97-101.2440
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Classical flexible job-shop scheduling problem (FJSP) does not consider the transportation time of jobs movement among different machines, which reduces the potential significance of its practical applications. This paper defines an FJSP problem with transportation time incurred by movement of jobs with one Automated Guided Vehicle (AGV) and one Load/Unload (L/U) station. A filtered beam search (FBS) based meta-heuristic algorithm is presented to solve this problem. The detailed procedure of the algorithm is described, and an example is shown to illustrate the algorithm. Finally, preliminary experimental results with comparisons of other dispatching rules demonstrate the feasibility and effectiveness of the proposed algorithm for the FJSP with transportation time.
引用
收藏
页码：2440 / 2443
页数：4
相关论文
共 50 条
  • [31] A hybrid genetic algorithm for multi-objective flexible job shop scheduling problem considering transportation time
    Huang, Xiabao
    Yang, Lixi
    [J]. INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2019, 12 (02) : 154 - 174
  • [32] Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously
    Jiang, Tianhua
    Zhu, Huiqi
    Liu, Lu
    Gong, Qingtao
    [J]. SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS, 2022, 35
  • [33] Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation
    Deroussi, L
    Gourgand, M
    Tchernev, N
    [J]. ETFA 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 1, PROCEEDINGS, 2001, : 659 - 667
  • [34] Flexible job shop scheduling with tabu search algorithms
    Mohammad Saidi-Mehrabad
    Parviz Fattahi
    [J]. The International Journal of Advanced Manufacturing Technology, 2007, 32 : 563 - 570
  • [35] Flexible job shop scheduling with tabu search algorithms
    Saidi-Mehrabad, Mohammad
    Fattahi, Parviz
    [J]. International Journal of Advanced Manufacturing Technology, 2007, 32 (5-6): : 563 - 570
  • [36] Flexible job shop scheduling with tabu search algorithms
    Saidi-Mehrabad, Mohammad
    Fattahi, Parviz
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 32 (5-6): : 563 - 570
  • [37] Improved artificial immune algorithm for the flexible job shop problem with transportation time
    Chen, Xiao-long
    Li, Jun-qing
    Han, Yu-yan
    Sang, Hong-yan
    [J]. MEASUREMENT & CONTROL, 2020, 53 (9-10): : 2111 - 2128
  • [38] Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
    Bissoli, Dayan C.
    Zufferey, Nicolas
    Amaral, Andre R. S.
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2021, 28 (05) : 2733 - 2758
  • [39] A Framework for Flexible Job Shop Scheduling Problem Using Simulation-Based Cuckoo Search Optimization
    Phanden, Rakesh Kumar
    Palkova, Zuzana
    Sindhwani, Rahul
    [J]. ADVANCES IN INDUSTRIAL AND PRODUCTION ENGINEERING, 2019, : 247 - 262
  • [40] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm
    Zhang, Guohui
    [J]. ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 : 1 - 5
12345