A New Dispatching Rule for the Stochastic Single-Machine Scheduling Problem

Simulation

Volumn 80, Issue 3, 2004, Pages 165-170

  al Turki, Umar ^a   Andijani, Abdulbasit ^a   Arifulsalam, Shaikh ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

dispatching rule; dynamic; Scheduling; stochastic

Indexed keywords

COMPLETION TIME VARIANCE; DISPATCHING RULE; SINGLE MACHINE SCHEDULING PROBLEM;

MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

COMPUTER SIMULATION;

EID: 4344639674     PISSN: 00375497     EISSN: None     Source Type: Journal    
DOI: 10.1177/0037549704045047     Document Type: Article

References (14)

1. [1] Merten, A. G., and M. E. Muller. 1972. Variance minimization in single machine sequencing problem. Management Science 18: 518-528.
2. [2] Eilon, S., and I. G. Chowdhury. 1977. Minimizing waiting time variance in the single machine problem. Management Science 23: 567-575.
3. [3] Pinedo, M. 1995. Scheduling theory, algorithms, and systems. Engle-wood Cliffs, NJ: Prentice Hall.
4. [4] Vani, V., and M. Raghavachari. 1987. Deterministic and random single machine sequencing with variance minimization. Operations Research 35: 111-120.
5. [5] Kubiak, W. 1993. Completion time variance minimization on a single machine is difficult. Operations Research Letters 14: 49-59.
6. [6] Ng, V. T., X. Cai, and T. C. E. Cheng. 1996. A tight lower bound for the completion time variance problem. European Journal of Operational Research 92: 211-213.
7. [7] Al-Turki, U. M. 2001. Simple heuristics for the single machine minimum variance scheduling problem. Arabian Journal for Science and Engineering 26 (2B): 127-132.
8. [8] De, P., J. B. Ghosh, and C. E. Wells. 1992. On the minimization of completion time variance with a bi-criteria extension. Operations Research 40: 1148-1155.
9. [9] Manna, D. K., and V. Prasad. 1997. Pseudo polynomial algorithm for CTV minimization in single machine scheduling. Computers and Operations Research 24: 1119-1128.
10. [10] Gere, W. S. 1966. Heuristics in job-shop scheduling. Management Science 13 (3): 167-190.
11. [11] Eilon, S., I. G. Chowdhury, and S. S. Serghiou. 1975. Experiments with the six rule in job-shop scheduling. SIMULATION 24: 45-48.
12. [12] Gonzalez, T., and S. Sahni. 1978. Flow-shop and job-shop scheduling: Complexity and approximation. Operations Research 26 (1): 36-52.
13. [13] Yang, K. K., and C. C. Sum. 1994. A compression of job-shop dispatching rules using a total cost criterion. International Journal of Production Research 32 (4): 807-820.
14. [14] Al-Turki, U. M., and A. A. Andijani. 1996. Stochastic job-shop scheduling: A simulation study. In Proceedings of the 20th International Conference on Computers & Industrial Engineering, October, Kyongju, Korea, pp. 845-848.