Makespan-related criteria for comparing schedules in stochastic environments

Journal of the Operational Research Society

Volumn 49, Issue 11, 1998, Pages 1188-1195

  Portougal, V ^a   Trietsch, D ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Scheduling; Stochastic schedules

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING; STATISTICAL METHODS; STRATEGIC PLANNING;

MAKESPAN-RELATED CRITERIA; STOCHASTIC SCHEDULING;

JUST IN TIME PRODUCTION;

EID: 0032204349     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600639     Document Type: Article

References (8)

1. Pinedo M (1995). Scheduling: Theory, Algorithms, and Systems. Prentice Hall, NJ, USA.
2. McKay KN, Safayeni FR and Buzacott JA (1988). Job-shop scheduling theory: What is relevant? Interfaces 18: 84-90.
3. Dodin B (1985). Bounding the project completion time distribution in PERT Networks, Opns Res 33: 862-881.
4. Dodin B (1996). Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops. Computers Ops Res 23: 829-843.
5. Ross SM (1996). Stochastic Processes, 2nd Edn., Wiley, New York.
6. Bowman RA and Muckstadt JA (1995). Production control of cyclic schedules with demand and process variability, Prod Opns Mgm 4: 145-162.
7. Vani V and Raghavachari M (1987). Deterministic and random single machine sequencing with variance minimisation, Opns Res 35: 111-126.
8. Soroush HM and Fredendall LD (1984). The Stochastic Single Machine Scheduling Problem with Earliness and Tardiness Costs. Eur J Op Res 77: 187-302.