SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS,TARDINESS AND COMPLETION TIME PENALTIES |
| |
| Authors: | DIRK BISKUP T C EDWIN CHENG |
| |
| Affiliation: | 1. University of Bielefeld, Faculty of Economics and Business Administration , Postfach 10 01 31, Bielefeld, 33501, Germany;2. Office of the Vice-President, (Research and Postgraduate Studies), The Hong Kong Polytechnic University , Hung Horn, Kowloon, Hong Kong |
| |
| Abstract: | The paper considers the problem of scheduling nindependent and simultaneously available jobs on a single machine, where the job processing times are compressible as a linear cost function. The objective is to find an optimal permutation of the jobs, an optimal due date and the optimal processing times which jointly minimize a cost function consisting of the earliness, tardiness, completion time and compressing costs. It shows that the problem can be solved as an assignment problem. |
| |
| Keywords: | Scheduling controllable processing times earliness/tardiness penalties |
|
|
