A Parallel Processors Scheduling Problems with a Common Due Date

Lee, Jeong-Hwan; No, In-Gyu

Journal of Korean Society for Quality Management > Volume 18(2); 1990 > Article

Journal of Korean Society for Quality Management 1990;18(2): 81-.

공통납기를 고려한 병렬기계 일정계획

이정환¹, 노인규²

¹동의대 산업공학과
²한양대 산업공학과

A Parallel Processors Scheduling Problems with a Common Due Date

Jeong-Hwan Lee¹, In-Gyu No²

¹
²

ABSTRACT

This paper considers a scheduling of a set of jobs on single and multiple processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. The objective is to determine the optimal value of a common due date and an optimal scheduling to minimize a total penalty function. It is also shown that a schedule having minimum weighted completion time variances must be V-shaped. For identical processors, a polynomial scheduling algorithm with the secondary objectives of minimizing makespan and machine occupancy is developed and a numerical example is presented.