Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method

被引:117
|
作者
Rossi, Andrea [1 ]
Dini, Gino [1 ]
机构
[1] Univ Pisa, Dept Mech Nucl & Prod Engn, I-56126 Pisa, Italy
关键词
job-shop scheduling; ant colony optimisation; flexible manufacturing systems;
D O I
10.1016/j.rcim.2006.06.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper proposes an ant colony optimisation- based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored ant colony operators for improving solution quality. The method used to tune the system parameters is also described. The algorithm has been tested by using standard benchmarks and problems, properly designed for a typical FMS layout. The effectiveness of the proposed system has been verified in comparison with alternative approaches. (C) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:503 / 516
页数:14
相关论文
共 50 条
  • [1] A parallel hybrid ant colony optimisation approach for job-shop scheduling problem
    Zhang, Haipeng
    Gen, Mitsuo
    [J]. International Journal of Manufacturing Technology and Management, 2009, 16 (1-2) : 22 - 41
  • [2] An approach for flexible job-shop scheduling with separable sequence-dependent setup time
    Guimaraes, Kairon Freitas
    Fernandes, Marcia Aparecida
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3727 - +
  • [3] Textile Flexible Job-Shop Scheduling Based on a Modified Ant Colony Optimization Algorithm
    Chen, Fengyu
    Xie, Wei
    Ma, Jiachen
    Chen, Jun
    Wang, Xiaoli
    [J]. APPLIED SCIENCES-BASEL, 2024, 14 (10):
  • [4] Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
    Ozguven, Cemal
    Yavuz, Yasemin
    Ozbakir, Lale
    [J]. APPLIED MATHEMATICAL MODELLING, 2012, 36 (02) : 846 - 858
  • [5] Multiple colony ant algorithm for job-shop scheduling problem
    Udomsakdigool, A.
    Kachitvichyanukul, V.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (15) : 4155 - 4175
  • [6] Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm
    Azzouz, Ameni
    Ennigrou, Meriem
    Ben Said, Lamjed
    [J]. PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, VOL 2 (ICEIS), 2016, : 47 - 53
  • [7] Job-shop scheduling problem with sequence dependent setup times
    Moghaddas, R.
    Houshmand, M.
    [J]. IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 1546 - 1552
  • [8] Application of Ant Colony Algorithm to Job-Shop Scheduling Problem
    Cao, Yan
    Lei, Lei
    Fang, Yadong
    [J]. PRECISION ENGINEERING AND NON-TRADITIONAL MACHINING, 2012, 411 : 407 - 410
  • [9] Ant Colony Optimization approach for Job-shop Scheduling Problem
    Zhang, Haipeng
    Gen, Mitsuo
    Fujimura, Shigeru
    Kim, Kwan Woo
    [J]. PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2004, 3 : 426 - 431
  • [10] Application of Ant Colony Algorithm in Discrete Job-shop Scheduling
    Sun, Bo
    Wang, Hui
    Fang, Yadong
    [J]. 2009 SECOND INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING: KAM 2009, VOL 2, 2009, : 29 - 32