On the Robust Single Machine Scheduling Problem

@article{Yang2002OnTR,
  title={On the Robust Single Machine Scheduling Problem},
  author={Jian Xi Yang and Gang Yu},
  journal={Journal of Combinatorial Optimization},
  year={2002},
  volume={6},
  pages={17-33}
}
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… CONTINUE READING
BETA

Tables and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 35 CITATIONS

Minimizing total weighted flow time under uncertainty using dominance and a stability box

  • Computers & OR
  • 2012
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Robust scheduling with budgeted uncertainty

  • Discrete Applied Mathematics
  • 2018
VIEW 3 EXCERPTS
CITES BACKGROUND & RESULTS

Evaluation model for the stochastic flowshop cyclic scheduling problem

  • 2017 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Robust preemptive scheduling on unrelated parallel machines under uncertain processing times

  • 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Single machine scheduling with uncertain release times

  • 2017 36th Chinese Control Conference (CCC)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…