An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines

被引：1
作者：
M. Rabiee
Reza Sadeghi Rad
M. Mazinani
R. Shafaei
机构：
[1] Bu-Ali Sina University,Department of Industrial Engineering, Tuyserkan’s Engineering Faculty
[2] Tarbiat Modares University,Department of Industrial Engineering, Faculty of Engineering
[3] K. N. Toosi University of Technology,Department of Industrial Engineering
来源：
The International Journal of Advanced Manufacturing Technology | 2014年 / 71卷
关键词：
No-wait; Flexible flow shop; Imperialist competitive algorithm; Simulated annealing; Variable neighborhood search; Taguchi experimental method;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper addresses the problem of no-wait two-stage flexible flow shop scheduling problem (NWTSFFSSP) considering unrelated parallel machines, sequence-dependent setup times, probable reworks and different ready times to actualize the problem. The performance measure used in this study is minimizing maximum completion time (makespan). Because of the complexity of addressed problem, we propose a novel intelligent hybrid algorithm [called hybrid algorithm (HA)] based on imperialist competitive algorithm (ICA) which are combined with simulated annealing (SA), variable neighborhood search (VNS) and genetic algorithm (GA) for solving the mentioned problem. The hybridization is carried out to overcome some existing drawbacks of each of these three algorithms and also for increasing the capability of ICA. To achieve reliable results, Taguchi approach is used to define robust parameters' values for our proposed algorithm. A simulation model is developed to study the performance of our proposed algorithm against ICA, SA, VNS, GA and ant colony optimization (ACO). The results of the study reveal the relative superiority of HA studied. In addition, potential areas for further researches are highlighted.
引用
收藏
页码：1229 / 1245
页数：16
相关论文
共 146 条
  • [1] Grabowski J(2000)Sequencing of jobs in some production system Eur J Oper Res 125 535-550
  • [2] Pempera J(2000)Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness Int J Prod Econ 64 101-111
  • [3] Botta-Genoulaz V(2003)Comparing scheduling rules for flexible flow lines Int J Prod Econ 85 371-388
  • [4] Kurz ME(2006)Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem Int J Prod Econ 100 322-334
  • [5] Askin RG(2006)A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility Eur J Oper Res 169 781-800
  • [6] Jin ZH(2006)An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times J Appl Math Comput 180 111-127
  • [7] Yang Z(2007)Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion Int J Prod Econ 105 407-424
  • [8] Ito T(2008)On the hybrid flowshop scheduling problem Int J Prod Econ 113 495-497
  • [9] Ruiz R(2011)Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach Int J Prod Res 50 2609-2623
  • [10] Maroto C(2011)A new mathematical model for integrating lot sizing, loading, and scheduling decisions in flexible flow shops Int J Adv Manuf Technol 55 709-721
12345678910