Minimizing the Weighted Mean Absolute Deviation of Job Completion Times about Two Common Due Dates

두개의 공통납기에 대한 작업완료시간의 W.M.A.D. 최소화에 관한 연구

This paper considers a non preemtive single processor scheduling problem in which each set have the two common due dates. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such two common due dates under the assumption that each job has a different weight. Such a job sequence is an W-shaped sequence. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. The performance comparison is made among three heuristic scheduling procedures.