On the Robust Single Machine Scheduling Problem
Jian Yang (yang@adm.njit.edu) and
Gang Yu
Additional contact information
Jian Yang: New Jersey Institute of Technology
Gang Yu: The University of Texas at Austin
Journal of Combinatorial Optimization, 2002, vol. 6, issue 1, No 2, 17-33
Abstract:
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.
Keywords: robust optimization; machine scheduling; NP-completeness; heuristic (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (19)
Downloads: (external link)
http://link.springer.com/10.1023/A:1013333232691 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013333232691
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1023/A:1013333232691
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).