Stochastic scheduling with optimal customer service

Journal of the Operational Research Society

Volumn 52, Issue 2, 2001, Pages 226-233

  Portougal, V ^a   Trietsch, D ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Scheduling; Stochastic processes

Indexed keywords

COMPUTER SIMULATION; CUSTOMER SATISFACTION; JOB SATISFACTION; RANDOM PROCESSES; SCHEDULING;

PROJECT SCHEDULING;

PROJECT MANAGEMENT;

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

References (7)

1. Pinedo M (1995). Scheduling: Theory, Algorithms, and Systems, Prentice Hall: Englewood Clilfs, NJ.
2. Portougal V and Trietsch D (1998). Makespan-related criteria for comparing schedules in stochastic environments. J Opl Res Soc49: 1188-1195.
3. Allahverdi A and Mittenthal J (1995). Scheduling on a two-machine flowshop subject to a random breakdowns with a makespan objective function. Eur J Oper Res 81: 376-387.
4. Dodin B (1985). Bounding the project completion time distribution in PERT networks. Oper Res 33: 862-881.
5. Dodin B (1996). Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops. Comp Oper Res 23: 829-843.
6. Vani V and Raghavachari M (1987). Deterministic and random single machine sequencing with variance minimisation. Oper Res35: 111-126.
7. Soroush HM and Fredendall LD (1994). The stochastic single machine scheduling problem with earliness and tardiness costs. Eur J Oper Res 77: 287-302.