Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints

• Published in: Journal of manufacturing systems Vol. 32; no. 1; pp. 167 - 173
• Main Authors: Vahedi-Nouri, Behdin, Fattahi, Parviz, Ramezanian, Reza
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.01.2013
• Subjects: Availability constraints; Heuristic method; Learning effects; Non-permutation flow shop; Scheduling; Learning effects; Scheduling; Non-permutation flow shop; Availability constraints; Heuristic method
• ISSN: 0278-6125; 1878-6642
• DOI: 10.1016/j.jmsy.2012.08.001

► We model the flow shop scheduling problem with learning effects and availability constraints. ► We proposed a effective heuristic to solve the problem. ► The non-permutation solutions is obtained in this paper. The flow shop scheduling problem is an attractive subject in the field of scheduling, which has attracted the attention of many researchers in the past five decades. In this paper, the non-permutation flow shop scheduling problem with the learning effects and machine availability constraints has been studied for minimizing the total flow time as a performance measure. First, a mixed integer linear programming model has been proposed for the modeling of the problem and then, an effective improving heuristic method, which is able to find proper non-permutation solutions, has been presented. Finally, the computational results are used for evaluation the performance and effectiveness of the proposed heuristic.