| Article ID: | iaor2006806 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 4 |
| Start Page Number: | 431 |
| End Page Number: | 436 |
| Publication Date: | Jul 2005 |
| Journal: | Operations Research Letters |
| Authors: | Kasperski Adam |
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.