| Article ID: | iaor19901126 |
| Country: | Japan |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 383 |
| End Page Number: | 389 |
| Publication Date: | Sep 1989 |
| Journal: | Journal of the Operations Research Society of Japan |
| Authors: | Ishii Hiroaki, Nishida Toshio, Tada Minoru |
| Keywords: | scheduling |
In usual scheduling problems, machine speed is considered to be constant. Here the authors assume that the machine speed is controllable for each job and consider the maximum lateness problem on a single machine. The objective is to determine an optimal schedule and optimal jobwise speed of the machine minimizing the total sum of costs associated with the maximum lateness and jobwise machine speed.