Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness |
| |
| Authors: | Zhongjun Tian C.T. Ng T.C.E. Cheng |
| |
| Affiliation: | aDepartment of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China;bSchool of International Business Administration, Shanghai University of Finance and Economics, Shanghai, China |
| |
| Abstract: | We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardiness, subject to agreeable due dates, i.e., a later release date corresponds to a later due date. We prove that the problem is  -hard in the ordinary sense by showing that it is  -hard, and deriving a pseudo-polynomial algorithm for it. |
| |
| Keywords: | Single machine Total tardiness Preemptive scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
