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 条
  • [21] The flexible job shop scheduling problem: A review
    Dauzere-Peres, Stephane
    Ding, Junwen
    Shen, Liji
    Tamssaouet, Karim
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 314 (02) : 409 - 432
  • [22] A Taxonomy for the Flexible Job Shop Scheduling Problem
    Cinar, Didem
    Topcu, Y. Ilker
    Oliveira, Jose Antonio
    [J]. OPTIMIZATION, CONTROL, AND APPLICATIONS IN THE INFORMATION AGE: IN HONOR OF PANOS M. PARDALOS'S 60TH BIRTHDAY, 2015, 130 : 17 - 37
  • [23] The generalized flexible job shop scheduling problem
    Boyer, Vincent
    Vallikavungal, Jobish
    Cantu Rodriguez, Xavier
    Angelica Salazar-Aguilar, M.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 160
  • [24] Application of Improved Sparrow Search Algorithm to Flexible Job Shop Scheduling Problem
    Xu, Long-Yan
    Zhao, Yi-Fan
    Li, Peng
    Li, Ming
    Zhai, Ya-Hong
    Huang, Li-Ming
    [J]. JOURNAL OF ELECTRICAL SYSTEMS, 2024, 20 (07) : 424 - 435
  • [25] A hybrid iterated local search metaheuristic for the flexible job shop scheduling problem
    Bissoli, Dayan de C.
    Amaral, Andre R. S.
    [J]. 2018 XLIV LATIN AMERICAN COMPUTER CONFERENCE (CLEI 2018), 2018, : 149 - 157
  • [26] Bilevel neighborhood search hybrid algorithm for the flexible job shop scheduling problem
    School of Mechanical Engineering, University of Jinan, Jinan
    250022, China
    [J]. Jixie Gongcheng Xuebao, 14 (175-184):
  • [27] A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
    Amiri, M.
    Zandieh, M.
    Yazdani, M.
    Bagheri, A.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (19) : 5671 - 5689
  • [28] A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem
    Vilcot, Geoffrey
    Billaut, Jean-Charles
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (23) : 6963 - 6980
  • [29] Flexible job shop scheduling problem with interval grey processing time
    Xie, Naiming
    Chen, Nanlei
    [J]. APPLIED SOFT COMPUTING, 2018, 70 : 513 - 524
  • [30] An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
    Gao, Kai Zhou
    Suganthan, Ponnuthurai Nagaratnam
    Pan, Quan Ke
    Tasgetiren, Mehmet Fatih
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (19) : 5896 - 5911
12345