Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm

详细信息    查看全文

• 作者：IMRAN ALI CHAUDHRY ; ISAM A Q ELBADAWI
• 关键词：Parallel machine scheduling ; genetic algorithm (GA) ; total tardiness ; scheduling
• 刊名：Sādhanā
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：42
• 期：1
• 页码：11-21
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Engineering, general;
• 出版者：Springer India
• ISSN：0973-7677
• 卷排序：42

文摘

In recent years research on parallel machine scheduling has received an increased attention. This paper considers minimisation of total tardiness for scheduling of n jobs on a set of m parallel machines. A spread-sheet-based genetic algorithm (GA) approach is proposed for the problem. The proposed approach is a domain-independent general purpose approach, which has been effectively used to solve this class of problem. The performance of GA is compared with branch and bound and particle swarm optimisation approaches. Two set of problems having 20 and 25 jobs with number of parallel machines equal to 2, 4, 6, 8 and 10 are solved with the proposed approach. Each combination of number of jobs and machines consists of 125 benchmark problems; thus a total for 2250 problems are solved. The results obtained by the proposed approach are comparable with two earlier approaches. It is also demonstrated that a simple GA can be used to produce results that are comparable with problem-specific approach. The proposed approach can also be used to optimise any objective function without changing the basic GA routine.