Scheduling algorithm based on evolutionary computing in identical parallel machine production line

被引:32
|
作者
Liu, M [1 ]
Wu, C [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Natl CIMS Engn Res Ctr, Beijing 100084, Peoples R China
关键词
parallel machine production line; scheduling algorithms; evolutionary programming; evolutionary fine-tuning; heuristic procedure; GENETIC ALGORITHMS; TUTORIAL SURVEY; FUTURE;
D O I
10.1016/S0736-5845(03)00041-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Evolutionary programming is a kind of evolutionary computing method based on stochastic search suitable for solving system optimization. In this paper, evolutionary programming method is applied to the identical parallel machine production line scheduling problem of minimizing the number of tardy jobs, which is a very important optimization problem in the field of research on CIMS and industrial engineering, and researches on problem formulation, expression of feasible solution, methods for the generation of the initial population, the mutation and improvement on the local search ability of evolutionary programming. Computational results of different scales of problems show that the evolutionary programming algorithm proposed in this paper is efficient, and that it is fit for solving large-scale identical parallel machine production line scheduling problems, and that the quality of its solution has advantage over so far the best heuristic procedure. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:401 / 407
页数:7
相关论文
共 50 条
  • [31] A Task Scheduling Algorithm based on Task Group for Parallel Computing
    Wang, Lei
    Wang, Hua-bing
    Chen, Ming-yan
    Zhang, Wei
    2015 INTERNATIONAL CONFERENCE ON SOFTWARE, MULTIMEDIA AND COMMUNICATION ENGINEERING (SMCE 2015), 2015, : 258 - 263
  • [32] On-line scheduling with rejection on identical parallel machines
    Miao C.
    Zhang Y.
    Journal of Systems Science and Complexity, 2006, 19 (3) : 431 - 435
  • [33] ON-LINE SCHEDULING WITH REJECTION ON IDENTICAL PARALLEL MACHINES
    Cuixia MIAO Department of Mathematics
    JournalofSystemsScience&Complexity, 2006, (03) : 431 - 435
  • [34] A new polynomial algorithm for a parallel identical scheduling problem
    Li Y.
    Li H.
    Yen V.C.
    Journal of Control Theory and Applications, 2007, 5 (4): : 345 - 350
  • [35] A parallel algorithm for production scheduling
    Ribeiro, JFF
    Ribeiro, CM
    de Oliveira, MMB
    MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 321 - 325
  • [36] A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption
    Liaw, Ching-Fang
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2016, 33 (06) : 426 - 434
  • [37] Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem
    Jarboui, Bassem
    Masmoudi, Malek
    Eddaly, Mansour
    COMPUTERS & OPERATIONS RESEARCH, 2024, 170
  • [38] A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
    Bianchessi, Nicola
    Tresoldi, Emanuele
    COMPUTERS & OPERATIONS RESEARCH, 2021, 136
  • [39] Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm
    Ghalami, Laleh
    Grosu, Daniel
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 133 : 221 - 231
  • [40] A PARALLEL ALGORITHM FOR THE MACHINE SCHEDULING PROBLEM
    NAKAMORI, M
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1988, 113 : 299 - 306