| Article ID: | iaor20043595 |
| Country: | Belarus |
| Volume: | 1 |
| Start Page Number: | 17 |
| End Page Number: | 27 |
| Publication Date: | Mar 2004 |
| Journal: | Informatics |
| Authors: | Gordon V.S., Smotrjaev V.N., Tarasevich A.A. |
| Keywords: | networks: scheduling |
A survey of scheduling methods is given for the problems where due dates, in contrast to traditional formulations, are not given a priori but are to be found. A special attention is focused on polynomial algorithms for the single machine scheduling and due date assignment problems.