dentical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem which has been proven to be NP-hard. The problem further compounds with additional constraints. Genetic algorithms (GA) have shown great advantages in solving the combinatorial optimization problem in view of its characteristic that has high efficiency and that is fit for practical application. In this chapter we present a spreadsheet based GA approach for minimizing the makespan for scheduling of a set of tasks for identical parallel machines and worker assignment to machines. The results obtained from the proposed approach are compared with two sets of benchmark problems consisting of 100 problems each. It has been demonstrated that the performance of proposed approach is superior to the results that have been obtained earlier. The proposed approach produces optimal solution for almost 95% of the problems demonstrating the effectiveness of the proposed approach. An empirical analysis of GA parameters has also been carried out to see the effect on the performance of the proposed algorithm.

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top

Document information

Published on 01/01/2011

DOI: https://doi.org/10.1007/978-94-007-1192-1_42
Licence: CC BY-NC-SA license

Document Score


Views 4
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?