On the robust single machine scheduling problem

Document Type

Article

Publication Date

3-1-2002

Abstract

The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncertainty of the processing times, a robustness approach is appropriate. In this paper, we show that the robust version of the (SS) problem is NP-complete even for very restricted cases. We present an algorithm for finding optimal solutions for the robust (SS) problem using dynamic programming. We also provide two polynomial time heuristics and demonstrate their effectiveness.

Identifier

0036498099 (Scopus)

Publication Title

Journal of Combinatorial Optimization

External Full Text Location

https://doi.org/10.1023/A:1013333232691

ISSN

13826905

First Page

17

Last Page

33

Issue

1

Volume

6

This document is currently not available here.

Share

COinS