On the robust single machine scheduling problem

Journal of Combinatorial Optimization

Volumn 6, Issue 1, 2002, Pages 17-33

  Yang, Jian ^a   Yu, Gang ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Heuristic; Machine scheduling; NP completeness; Robust optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); UNCERTAIN SYSTEMS;

COMPLETION TIMES CRITERION; ROBUST SINGLE MACHINE SCHEDULING PROBLEM; SHORTEST PROCESSING TIME;

SCHEDULING;

EID: 0036498099     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013333232691     Document Type: Article

References (19)

1. A static optimization algorithm minimizing expected flowtime on uniform processors
2. Two-machine ordered flowshop scheduling under random breakdowns
3. Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time
4. Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
5. Single machine scheduling subject to stochastic breakdowns
6. Assessing the effects of machine breakdown in stochastic scheduling
7. Robust scheduling to hedge against processing time uncertainty in single-stage production
8. A note on minimizing the expected makespan in flowshops subject to breakdowns
9. Scheduling stochastic jobs with due dates on parallel machines
10. Scheduling tasks with exponential service times on parallel processors
11. Evaluating the effects of machine breakdowns in stochastic scheduling problems
12. On non-preemptive policies for stochastic single machine scheduling with breakdown
13. Optimal scheduling of jobs with exponential service times on identical parallel machines
14. Scheduling jobs subject to nonhomogeneous Poisson shocks
15. Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions
16. On the robust shortest path problem