Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

详细信息    查看全文

• 作者：Gowrishankar ; K. ; Rajendran ; Chandrasekharan ; Srinivasan ; G.
• 关键词：Flow shop scheduling ; Completion time variance ; MSD problem ; Heuristic
• 刊名：European Journal of Operational Research
• 出版年：2001
• 出版时间：August 1, 2001
• 年：2001
• 卷：132
• 期：3
• 页码：643-665
• 全文大小：196 K

文摘

We consider two problems of m-machine flow shop scheduling in this paper: one, with the objective of minimizing the variance of completion times of jobs, and the other with the objective of minimizing the sum of squares of deviations of job completion times from a common due date. Lower bounds on the sum of squares of deviations of job completion times from the mean completion time of jobs for a given partial sequence are first presented. Using these lower bounds, a branch and bound algorithm based on breadth-first search procedure for scheduling n jobs on m-machines with the objective of minimizing completion time variance (CTV) is developed to obtain the best permutation sequence. We also present two lower bounds and thereafter, a branch and bound algorithm with the objective of minimizing the sum of squares of deviations of job completion times from a given common due date (called the MSD problem). The computational experience with the working of the two proposed branch and bound algorithms is also reported. Two heuristics, one for each of the two problems, are developed. The computational experience on the evaluation of the heuristics is discussed.