| Article ID: | iaor2003517 |
| Country: | China |
| Volume: | 5 |
| Issue: | 4 |
| Start Page Number: | 27 |
| End Page Number: | 34 |
| Publication Date: | Nov 2001 |
| Journal: | OR Transactions |
| Authors: | Zhang Feng, Chen Dewu |
In this paper, we discuss a new kind of single machine scheduling problems with controllable processing times. The objective function being considered is the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs' processing times that deviated from their specified ones. We present a polynomial algorithm to solve the problem.