On the Robust Single Machine Scheduling Problem
Source: Journal of Combinatorial Optimization, Volume 6, Number 1, March 2002 , pp. 17-33(17)
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.
Document Type: Regular Paper
Affiliations: 1: Department of Industrial and Manufacturing Engineering, New Jersey Institute of Technology, Newark, NJ 07102. email@example.com 2: Department of Management Science and Information Systems, and Center for Management of Operations and Logistics, The University of Texas at Austin, Austin, TX 78712-1177, USA
Publication date: March 2002