Opening book details…
About this Mathematics article
The NP-completeness of the n/m/parallel/Cmax preemptive due-date scheduling problem by T.C.E. Cheng; C.C.S. Sin is a Mathematics article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- T.C.E. Cheng; C.C.S. Sin
- Publisher
- Elsevier Science; Elsevier ; Pergamon Press Ltd.; Elsevier BV (ISSN 0895-7177)
- Published
- 1990
- Language
- EN
- Field
- Mathematics (Physical Sciences)