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 条
  • [21] Scheduling with Rejection to Minimize the Makespan
    Zhang, Yuzhong
    Ren, Jianfeng
    Wang, Chengfei
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 411 - 420
  • [22] Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
    Allahverdi, Ali
    Allahverdi, Muberra
    [J]. RAIRO-OPERATIONS RESEARCH, 2023, 57 (04) : 1733 - 1743
  • [23] SCHEDULING IN NORMAL-JOB, META-STAGE FLOWSHOP WITH PARALLEL PROCESSORS TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    CHAUDHURI, D
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1992, 27 (02) : 137 - 143
  • [24] THREE-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH BOUNDED SETUP AND PROCESSING TIMES
    Allahverdi, Ali
    [J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2008, 25 (01) : 52 - 61
  • [25] Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan
    Allahverdi, Muberra
    Allahverdi, Ali
    [J]. RAIRO-OPERATIONS RESEARCH, 2020, 54 (02) : 529 - 553
  • [26] Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    Rajendran, C
    Ziegler, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (02) : 426 - 438
  • [27] Minimize makespan of permutation flowshop using pointer network
    Cho, Young In
    Nam, So Hyun
    Cho, Ki Young
    Yoon, Hee Chang
    Woo, Jong Hun
    [J]. JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING, 2022, 9 (01) : 51 - 67
  • [28] Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan
    Aydilek, Asiye
    Aydilek, Harun
    Allahverdi, Ali
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (09) : 2803 - 2819
  • [29] Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
    Sun, X
    Morizawa, K
    Nagasawa, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 146 (03) : 498 - 516
  • [30] No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2020, 365