Heuristics for scheduling in a flowshop with setup, processing and removal times separated

被引:27
|
作者
Rajendran, C [1 ]
Ziegler, H [1 ]
机构
[1] UNIV PASSAU,FAC BUSINESS ADM & ECON,DEPT PROD MANAGEMENT,D-94032 PASSAU,GERMANY
关键词
flowshop scheduling; makespan; setup; processing and removal times; heuristics;
D O I
10.1080/095372897234902
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan. Heuristic algorithms are developed by the introduction of simplifying assumptions into the scheduling problem under study. An improvement method is incorporated in the heuristics to enhance the quality of their solutions. The proposed heuristics and an existing heuristic are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various values of parameters are presented.
引用
收藏
页码:568 / 576
页数:9
相关论文
共 50 条
  • [31] Two-stage no-wait scheduling models with setup and removal times separated
    Gupta, JND
    Strusevich, VA
    Zwaneveld, CM
    COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (11) : 1025 - 1031
  • [32] Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times
    Hatami, Sara
    Ebrahimnejad, Sadalah
    Tavakkoli-Moghaddam, Reza
    Maboudian, Yasaman
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 50 (9-12): : 1153 - 1164
  • [33] Heuristics for the mixed no-idle flowshop with sequence-dependent setup times
    Rossi, Fernando Luis
    Nagano, Marcelo Seido
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2021, 72 (02) : 417 - 443
  • [34] Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times
    Sara Hatami
    Sadalah Ebrahimnejad
    Reza Tavakkoli-Moghaddam
    Yasaman Maboudian
    The International Journal of Advanced Manufacturing Technology, 2010, 50 : 1153 - 1164
  • [35] Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
    Allahverdi, Ali
    Aydilek, Harun
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (05) : 1374 - 1384
  • [36] Two-machine flowshop scheduling to minimize total completion time with separate setup and removal times
    Allahverdi, A
    Aldowaisan, T
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2002, 9 (03): : 275 - 286
  • [37] New heuristics for flowshop scheduling
    Chakraborty, UK
    APPLICATIONS AND SCIENCE IN SOFT COMPUTING, 2004, : 81 - 86
  • [38] Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan
    Aydilek, Asiye
    Aydilek, Harun
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (09) : 2803 - 2819
  • [39] Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times
    Allahverdi, Ali
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2006, 33 (02): : 233 - 252
  • [40] Scheduling a three-machine no-wait flowshop with separated setup time
    常俊林
    邵惠鹤
    Journal of Harbin Institute of Technology, 2006, (02) : 206 - 210