《2016 An efficient knowledge-based algorithm for the flexible job shop scheduling problem》.pdf

Knowledge-Based Systems 36 (2012) 236–244 Contents lists available at SciVerse ScienceDirect Knowledge-Based Systems journal homepage: www.else /locate/knosys An efficient knowledge-based algorithm for the flexible job shop scheduling problem Hamid Karimi a, Seyed Habib A. Rahmati a, M. Zandieh b,⇑ a Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran b Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran a r t i c l e i n f o a b s t r a c t Article history: Flexible job shop scheduling problem (FJSP) is quite a difficult combinatorial model. Various metaheuris- Received 3 July 2011 tic algorithms are used to find a local or global optimum solution for this problem. Among these algo- Received in revised form 19 March 2012 rithms, variable neighborhood search (VNS) is a capable one and makes use of a systematic change of Accepted 1 April 2012 neighborhood structure for evading local optimum. The search process for finding a local or global opti- Available online 27 June 2012 mum solution by VNS is totally random. This is one of the weaknesses of this algorithm. To remedy this weakness of VNS, this paper combines VNS algorithm with a knowledge module and proposes Keywords: knowledge-based VNS (KBVNS). In KBVNS, the VNS par