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 条
  • [1] A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
    Wang Shi-Jin
    Zhou Bing-Hai
    Xi Li-Feng
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (11) : 3027 - 3058
  • [2] Discrepancy search for the flexible job shop scheduling problem
    Ben Hmida, Abir
    Haouari, Mohamed
    Huguet, Marie-Jose
    Lopez, Pierre
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) : 2192 - 2201
  • [3] List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
    Birgin, E. G.
    Ferreira, J. E.
    Ronconi, D. P.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (02) : 421 - 440
  • [4] Solving Flexible Job Shop Scheduling Problem with Transportation Time Based on Neuro Fuzzy Suggested Metaheuristics
    Stankovic, Aleksandar
    Petrovic, Goran
    Markovic, Danijel
    Cojbasic, Zarko
    [J]. ACTA POLYTECHNICA HUNGARICA, 2022, 19 (04) : 209 - 227
  • [5] Adaptive salp swarm algorithm for solving flexible job shop scheduling problem with transportation time
    Niu, Hao-Yi
    Wu, Wei-Min
    Zhang, Ting-Qi
    Shen, Wei
    Zhang, Tao
    [J]. Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2023, 57 (07): : 1267 - 1277
  • [6] Job shop scheduling with beam search
    Sabuncuoglu, I
    Bayiz, M
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 118 (02) : 390 - 412
  • [7] A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem
    Guohui Zhang
    Lingjie Zhang
    Xiaohui Song
    Yongcheng Wang
    Chi Zhou
    [J]. Cluster Computing, 2019, 22 : 11561 - 11572
  • [8] A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem
    Zhang, Guohui
    Zhang, Lingjie
    Song, Xiaohui
    Wang, Yongcheng
    Zhou, Chi
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 5): : 11561 - 11572
  • [9] A hybrid harmony search algorithm for the flexible job shop scheduling problem
    Yuan, Yuan
    Xu, Hua
    Yang, Jiadong
    [J]. APPLIED SOFT COMPUTING, 2013, 13 (07) : 3259 - 3272
  • [10] Scatter search with path relinking for the flexible job shop scheduling problem
    Gonzalez, Miguel A.
    Vela, Camino R.
    Varela, Ramiro
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 245 (01) : 35 - 45
12345