A Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling

Journal of Optimization in Industrial Engineering

مقاله 8، دوره 5، شماره 10، خرداد 2012، صفحه 65-72   

نوع مقاله: Original Manuscript

نویسندگان

Esmaeil Najafi¹؛ Bahman Naderi²؛ Hassan Sadeghi³؛ Mehdi Yazdani^{* 4}

¹Department of industrial engineering, Science & Research Branch, Islamic Azad University, Tehran, Iran

²Department of Industrial Engineering, Faculty of Engineering, University of Kharazmi, Karaj, Iran

³Young Researchers Club, Islamic Azad University , Qazvin Branch, Qazvin, Iran

⁴Department of industrial engineering, Qazvin branch, Islamic Azad University, Qazvin, Iran

چکیده

This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate the model
and the algorithm. In the first one, the general performance of the model and the proposed algorithm is experimented. In the next one, the presented algorithm is compared against some other algorithms. The results support high performance of the proposed algorithm. 

کلیدواژه‌ها

Scheduling؛ Hybrid flow shop؛ Mathematical model؛ Mixed integer linear program؛ Artificial immune algorithm