| Article ID: | iaor2009232 |
| Country: | Germany |
| Volume: | 13 |
| Issue: | 1 |
| Start Page Number: | 13 |
| End Page Number: | 35 |
| Publication Date: | Feb 2005 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Proth Jean-Marie, Gordon Valery, Strusevich Vitaly |
| Keywords: | graphs |
We consider a single machine due date assignment and scheduling problem of minimizing holding costs with no tardy jobs under series–parallel and somewhat wider class of precedence constraints as well as the properties of series–parallel graphs.