Search

No-wait flowshop scheduling is a constrained flow shop scheduling problem that exists widely in manufacturing systems. This paper considers minimization of makespan (total completion time) for n number of jobs to be processed on m machines using a general purpose spreadsheet based genetic algorithm (GA). The proposed approach solution is compared with already published problems in the literature. The proposed approach produces optimal solution for all cases. Additionally it is also shown that any objective function can be minimised using the same model without changing the logic of the GA routine. [ABSTRACT FROM AUTHOR]