Scheduling jobs with chain precedence constraints and deteriorating jobs |
| |
| Authors: | J-B Wang J-J Wang P Ji |
| |
| Institution: | 1.Shenyang Aerospace University,Shenyang,China;2.Dalian University of Technology,Dalian,China;3.The Hong Kong Polytechnic University,Kowloon, Hong Kong,China |
| |
| Abstract: | In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
