Minimizing the number of late jobs in a stochastic setting using a chance constraint

Journal of Scheduling

Volumn 11, Issue 1, 2008, Pages 59-69

  Van Den Akker, Marjan ^a   Hoogeveen, Han ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Chance constraint; Dynamic programming; Minimum success probability; NP hardness; Number of late jobs; Scheduling; Sequencing; Single machine; Stochastic processing times

Indexed keywords

CHANCE CONSTRAINTS; MINIMUM SUCCESS PROBABILITY;

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; JOB ANALYSIS; PROBABILITY; PROBLEM SOLVING;

SCHEDULING;

EID: 38349102788     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0034-8     Document Type: Article

References (9)

1. Dean, B. C. (2005). Approximation algorithms for stochastic scheduling problems. PhD thesis, MIT. www.cs.clemson.edu/~bcdean/bdean_phd_thesis.pdf.
2. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project, University of California, Los Angeles.
3. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum.
4. Law, A. M., & Kelton, W. D. (2000). Simulation modeling and analysis. New York: McGraw-Hill.
5. Lawler, E. L. (unpublished) Scheduling a single machine to minimize the number of late jobs. Unpublished manuscript.
6. Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77-84.
7. Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544-546.
8. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102-109.
9. van den Akker, J. M., & Hoogeveen, J. A. (2004). Minimizing the number of tardy jobs. In J. Y. -T. Leung (Ed.), Handbook of scheduling, algorithms, models, and performance analysis (pp. 227-243). Boca Raton: CRC Press.