Heuristics to minimize the completion time variance of jobs on a single machine and on identical parallel machines

详细信息    查看全文

• 作者：Raju Rajkanth ; Chandrasekharan Rajendran…
• 关键词：Single ; machine scheduling ; Parallel ; machine scheduling ; Completion time variance ; Heuristics
• 刊名：The International Journal of Advanced Manufacturing Technology
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：88
• 期：5-8
• 页码：1923-1936
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Industrial and Production Engineering; Media Management; Mechanical Engineering; Computer-Aided Engineering (CAD, CAE) and Design;
• 出版者：Springer London
• ISSN：1433-3015
• 卷排序：88

文摘

This paper addresses the problem of scheduling n jobs on a single machine and on m identical parallel machines to minimize the completion time variance of jobs. This problem of scheduling jobs on parallel machines is motivated by a case study in an automobile ancillary unit. First, a heuristic to solve the single-machine scheduling problem is proposed. The parallel-machine scheduling problem is solved in two phases: job-allocation phase and job-sequencing phase. Two heuristics are proposed in the job-allocation phase, whereas in the job-scheduling phase, the single-machine scheduling approach is used. In this paper, both versions of parallel-machine scheduling problem (restricted and unrestricted) are considered. A good upper bound is obtained using a genetic algorithm, to evaluate the performance of the proposed heuristics for the parallel-machine scheduling problem. An extensive computation evaluation of the proposed heuristics is presented for both single-machine scheduling problem and the parallel-machine scheduling problem (especially considering the case study), along with the comparison of performances with the existing heuristics in the literature.