《2016 A heuristic algorithm for solving flexible job shop scheduling problem》.pdf

Int J Adv Manuf Technol (2014) 71:519–528 DOI 10.1007/s00170-013-5510-z ORIGINAL ARTICLE A heuristic algorithm for solving flexible job shop scheduling problem Mohsen Ziaee Received: 14 December 2011 /Accepted: 18 November 2013 /Published online: 1 December 2013 # Springer-Verlag London 2013 Abstract This paper deals with the flexible job shop sched- a set of n jobs must be processed on a group of m machines, uling problem with the objective of minimizing the makespan. where the processing of each job i consists of J i operations An efficient heuristic based on a constructive procedure is performed on these machines. Each job has a specified pro- developed to obtain high-quality schedules very quickly. The cessing order on the machines which is fixed and known in algorithm is tested on benchmark instances from the literature advance, i.e., each operation has to be performed on a given in order to evaluate its performance. Computational results machine. Moreover, the processing times of all operations are show that, despite its simplicity, the proposed heuristic can fixed and known. Each machine is continuously available obtain effective solutions in very short and nearly zero time from time zero and can process at most one operation at a and is comparable with even metaheuristic algorithms and time. The operations are processed on the machines without promising for practical problems. interruption [2]. A typical performance indicator for the JSP is the makespan, i.e., the time needed to complete all the jobs. In modern manufacturing environments, a machine may Keywords Scheduling . Flexible job