2019 | vol. 67 | nr. 2 | art. 15

A Makespan Minimization Hybrid Algorithm for Flexible Job Shop System Scheduling

Nassima KEDDARI, Ahmed HASSAM, Zaki SARI
Abstract
Global Market World scenario requires a flexible manufacturing scheduling to stay competitive in today's economy. Several actual scheduling problems can be formulated to flexible job shop scheduling problem, due to production flexibility. This type of system often leads to an efficient resource utilization. Scheduling has become a critical factor in many job shops especially for real-world industrial application. This work addresses scheduling in a flexible job shop environment. In this paper, our crucial challenge lies in developing a hybrid method that achieves a hybrid method that achieve effectively and efficiently the completion times of jobs (the makespan objective).This method is made up of a shifting bottleneck heuristic (SBH) as a starting solution and tabu search (TS) as a local search method. The performance of our approach is tested on a number of well-known fJSP benchmark problems and is compared with several lately algorithms, to show the efficiency of the suggested methodology. Thereby, the characteristics and merits of the proposed method are highlighted.
Keywords: Scheduling, flexibility, flexible job shop, shifting bottleneck, taboo search
To cite this article: KEDDARI N., HASSAM A., SARI Z., “A Makespan Minimization Hybrid Algorithm for Flexible Job Shop System Scheduling”, in Electrotehnica, Electronica, Automatica (EEA), 2019, vol. 67, no. 2, pp. 130-138, ISSN 1582-5175.

 

Download