首页 | 官方网站   微博 | 高级检索  
     


Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem
Affiliation:1. Departamento de Ciências Exatas e Tecnológicas, Universidade Estadual de Santa Cruz, Ilhéus, Bahia, Brazil;2. Systems and Control Department, Technological Institute of Aeronautics, São José dos Campos, São Paulo, Brazil;3. Department of Electrical & Computer Engineering, University of Alberta, Edmonton T6R 2V4, AB, Canada;4. Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia;5. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland;1. BITS Pilani-Goa Campus, Zuarinagar, India;2. Department of Electrical & Computer Engineering, Ryerson University, Toronto, Ontario, Canada;1. Department of Electrical Engineering, University of Neyshabur, Neyshabur, Iran;2. Department of Electrical Engineering, Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, P.O. Box 91775-1111, Mashhad, Iran;1. Department of Chemical and Materials Engineering, University of Alberta, Edmonton, Alberta T6G 2V4, Canada;2. Syncrude Canada Ltd., Fort McMurray, Alberta T9H 3L1, Canada
Abstract:In this paper hybrid flow shop scheduling problem with two agents is studied and its feasibility model is considered. A two-phase neighborhood search (TNS) algorithm is proposed to minimize objectives of two agents simultaneously under the given upper bounds. TNS is constructed through the combination of multiple variable neighborhood mechanisms and a new perturbation strategy for new current solution. A new replacement principle is also applied to decide if the current solution can be updated. TNS is tested on a number of instances and compared with the existing methods. The computational results show the promising advantage of TNS on the considered problem.
Keywords:Hybrid flow shop scheduling  Feasibility model  Two-phase neighborhood search
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号