A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Tools
Tools
Tools
Kellerer, Hans and Strusevich, Vitaly A. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369 (1-3). pp. 230-238. ISSN 0304-3975 (doi:10.1016/j.tcs.2006.08.030 |)
Full text not available from this repository.| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| School / Department / Research Groups: | School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences |
| Related URLs: | |
| Last Modified: | 13 May 2013 16:33 |
| URI: | http://gala.gre.ac.uk/id/eprint/3665 |
Actions (login required)
| View Item |