| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524224 | Operations Research Letters | 2005 | 6 Pages |
Abstract
In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Adam Kasperski,