Dynamic scheduling of stochastic jobs on a single machine

European Journal of Operational Research

Volumn 138, Issue 3, 2002, Pages 518-530

  Jang, Wooseung ^a  

^a University of Missouri   (United States)

Author keywords

Heuristics; Scheduling theory; Single machine; Stochastic scheduling; Tardy jobs

Indexed keywords

COMPUTATION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

DYNAMIC SCHEDULING; STOCHASTIC JOBS;

JOB ANALYSIS;

EID: 0036567985     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00174-6     Document Type: Article

References (15)

1. Scheduling to minimize the number of late jobs when set-up and processing times are uncertain
2. Bounds on optimal values in stochastic scheduling
3. Minimizing the expected weighted number of tardy jobs in stochastic flow shops
4. Scheduling stochastic jobs with asymmetric earliness and tardiness penalties
5. Rearrangement, majorization and stochastic scheduling
6. On the minimization of the weighted number of tardy jobs with random processing times and deadline
7. Minimizing total tardiness on one processor is NP-hard
8. Reducibility among combinatorial problems
9. On Bault's algorithm and NP-completeness for a chance-constrained scheduling problem
10. Stochastic scheduling with release dates and due dates
11. Scheduling
12. Sequencing jobs on a single machine with a common due dates and stochastic processing times
13. The stochastic single machine scheduling problem with earliness and tardiness costs