| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 475747 | Computers & Operations Research | 2011 | 4 Pages |
Abstract
We describe an improved algorithm of complexity O(n log n). We show further how to perform sensitivity analysis on the processing time of a job without increasing the complexity.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.C. Janssen, R.J.D. Verbeek, A. Volgenant,