Abstract
The concept of parallel machines has been widely used in manufacturing. This article proposes a genetic algorithm (GA) approach to minimize total tardiness of a set of tasks for identical parallel machines and worker assignment to machines. A spreadsheet-based GA approach is presented to solve the problem. A domain-independent general purpose GA is used, which is an add-in to the spreadsheet software. The paper demonstrates an adaptation of the proprietary GA software to the problem of minimizing total tardiness for the worker assignment scheduling problem for identical parallel machine models. Two 100 I/P/n/m/W problems taken from Hu (Int J Adv Manuf Technol 23:383-388, 2004, Int J Adv Manuf Technol 29:165-169, 2006) for a similar study are simulated. The performance of GA is superior to SES-A/LMC approach used by Hu and very close to the Exhaustive search procedure. It is shown that the spreadsheet GA implementation makes it very easy to adapt the problem for any set of objective measures without changing the actual model. Empirical analysis has been carried out to study the effect of GA parameters, namely, crossover rate, mutation rate, and the population size.