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 条
  • [1] Concurrent flowshop scheduling to minimize makespan
    Koulamas, C
    Kyparisis, GJ
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (02) : 524 - 529
  • [2] Scheduling the distributed assembly flowshop problem to minimize the makespan
    Ochi, Hanadi
    Driss, Olfa Belkahla
    [J]. CENTERIS2019--INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS/PROJMAN2019--INTERNATIONAL CONFERENCE ON PROJECT MANAGEMENT/HCIST2019--INTERNATIONAL CONFERENCE ON HEALTH AND SOCIAL CARE INFORMATION SYSTEMS AND TECHNOLOGIES, 2019, 164 : 471 - 477
  • [3] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
  • [4] Batching and scheduling to minimize the makespan in the two-machine flowshop
    Cheng, TCE
    Wang, GQ
    [J]. IIE TRANSACTIONS, 1998, 30 (05) : 447 - 453
  • [5] Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan
    Chin-Chia Wu
    Shang-Chia Liu
    T. C. E. Cheng
    Yu Cheng
    Shi-Yuan Liu
    Win-Chin Lin
    [J]. Iranian Journal of Science and Technology, Transactions A: Science, 2018, 42 : 727 - 744
  • [6] A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
    Wang, Cheng
    Song, Shiji
    Gupta, Jatinder N. D.
    Wu, Cheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2880 - 2887
  • [7] Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan
    Wu, Chin-Chia
    Liu, Shang-Chia
    Cheng, T. C. E.
    Cheng, Yu
    Liu, Shi-Yuan
    Lin, Win-Chin
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2018, 42 (A2): : 727 - 744
  • [8] A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
    Braglia, Marcello
    Grassi, Andrea
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (01) : 273 - 288
  • [9] A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) : 773 - 785
  • [10] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
    Lin, BMT
    Cheng, TCE
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624