Analysis of antithetic sequences in flowshop scheduling to minimize makespan

被引:1
|
作者
Moras, R
Smith, ML
Kumar, KS
Azim, MA
机构
[1] TEXAS TECH UNIV,LUBBOCK,TX 79409
[2] TT TECHNOL PARTNERS,SAN JOSE,CA
[3] ENGN SERV GRP,FARMINGTON,MI
关键词
sequencing; scheduling; heuristics;
D O I
10.1080/095372897234678
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The antithetic properties of flowshop sequences are investigated to improve the classical Monte Carlo method for solving the n-job, m-machine problem with minimization of makespan. The major issues considered are (1) establishing a negative correlation of the makespan values of forward and reverse sequences; (2) developing the Antithetical Monte Carlo (AMC) method, which can be used to quickly estimate the mean of the makespan distribution by exploiting the antithetic property of sequences; (3) using AMC to find low makespan values; (4) determining a threshold value of makespan beyond which it would be likely to find an optimal or near optimal makespan when reversing a sequence. Statistical tests indicate that the performance of AMC is superior to that of the classical Monte Carlo method. Possible applications of this concept are discussed including extensions to other mathematical problems with antithetic properties.
引用
收藏
页码:780 / 787
页数:8
相关论文
共 50 条
  • [41] A hybrid approach for minimizing makespan in permutation flowshop scheduling
    Kannan Govindan
    R. Balasundaram
    N. Baskar
    P. Asokan
    [J]. Journal of Systems Science and Systems Engineering, 2017, 26 : 50 - 76
  • [42] Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints
    Li, Yuan-Zhen
    Gao, Kaizhou
    Meng, Lei-Lei
    Jing, Xue-Lei
    Zhang, Biao
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2023, : 221 - 238
  • [43] Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking
    Sanches, Felipe Borreiro
    Takano, Mauricio Iwama
    Nagano, Marcelo Seido
    [J]. ACTA SCIENTIARUM-TECHNOLOGY, 2016, 38 (03) : 321 - 326
  • [44] SCHEDULING NETWORK FLOWSHOPS SO AS TO MINIMIZE MAKESPAN
    KURIYAN, K
    REKLAITIS, GV
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1989, 13 (1-2) : 187 - 200
  • [45] Scheduling with periodic availability constraints to minimize makespan
    Yu, Lishi
    Tan, Zhiyi
    [J]. JOURNAL OF SCHEDULING, 2024, 27 (03) : 277 - 297
  • [46] Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan
    Chao Wang
    Xi-wen Lu
    René Sitters
    [J]. Acta Mathematicae Applicatae Sinica, English Series, 2018, 34 : 597 - 609
  • [47] A heuristic to minimize makespan of cell scheduling problem
    Solimanpur, M
    Vrat, P
    Shankar, R
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 88 (03) : 231 - 241
  • [48] A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
    RAJENDRAN, C
    CHAUDHURI, D
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1991, 34 (01) : 28 - 46
  • [49] Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan
    Chao WANG
    Xi-wen LU
    René SITTERS
    [J]. Acta Mathematicae Applicatae Sinica, 2018, 34 (03) : 597 - 609
  • [50] Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan
    Wang, Chao
    Lu, Xi-wen
    Sitters, Ren
    [J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2018, 34 (03): : 597 - 609