Minimizing the number of tardy jobs with stochastically-ordered processing times

Journal of Scheduling

Volumn 11, Issue 1, 2008, Pages 71-73

  Trietsch, Dan ^a   Baker, Kenneth R ^b  

^a AMERICAN UNIVERSITY OF ARMENIA   (Armenia)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

Polynomial algorithm; Sequencing; Stochastic scheduling

Indexed keywords

POLYNOMIAL ALGORITHMS; STOCHASTIC SCHEDULING;

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

RANDOM PROCESSES;

EID: 38349113203     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0022-z     Document Type: Article

References (5)

1. van den Akker, J. M. Hoogeveen, J. A. (2007, to appear). Minimizing the number of late jobs in case of stochastic processing times with minimum success probabilities. Journal of Scheduling.
2. Balut, S. J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19, 1283-1288.
3. Kise, H., & Ibaraki, T. (1983). On Balut's algorithm and NP-completeness for a chance constrained scheduling problem. Management Science, 29, 384-388.
4. Moore, J. M. (1968). An n Job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102-109.
5. Ross, S. M. (1996). Stochastic processes (2nd ed.). New York: Wiley.