Using "look ahead" techniques in job-shop scheduling with random operations

International Journal of Production Economics

Volumn 50, Issue 1, 1997, Pages 13-22

  Golenko Ginzburg, Dimitri ^a   Gonik, Aharon ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Luxembourg Industries   (Israel)

Author keywords

"Look ahead" techniques; Job shop problem; Priority rule; Random operation; Tense job; Waiting

Indexed keywords

PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

JOB SHOP PROBLEM; LOOK AHEAD SCHEDULING TECHNIQUES; PRIORITY RULE; STARTING TIME VALUES; TENSE JOBS;

PRODUCTION CONTROL;

EID: 0031145269     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(97)00018-2     Document Type: Article

References (15)

1. Barker, J.R. and Graham, B.M., 1985. Scheduling the general job-shop. Mgmt. Sci., 31(5): 594-598.
2. Coffman, E.G., 1976. Computer and Job-Shop Scheduling Theory. Wiley, New York.
3. Conway, R.W., Maxwell, W.L. and Miller, L.W., 1967. Theory of Scheduling. Addison-Wesley, Reading, MA.
4. French, S., 1982. Sequencing and Scheduling. Wiley, New York.
5. Gere, W.S., 1966. Heuristics in job-shop scheduling. Mgmt. Sci., 13(3): 167-190.
6. Golenko-Ginzburg, D.I., 1973. Statistical Models in Production Control. Statistika, Moscow (in Russian).
7. Golenko-Ginzburg, D., Kesler, Sh. and Landsman, Z., 1995. Industrial job-shop scheduling with random operations and different priorities. Int. J. Prod. Econ., 40: 185-195.
8. Panwalker, R. and Iskander, W., 1977. A survey of scheduling rules. Oper. Res., 25(1): 45-59.
9. Pinedo, M., 1982. Minimizing the expected makespan in stochastic flow shops. Oper. Res., 30: 148-162.
10. Pinedo, M., 1983. Stochastic scheduling with release dates and due dates. Oper. Res., 31: 559-572.
11. Pinedo, M. and Weiss, G., 1979. Scheduling of stochastic tasks on two parallel processors. Naval Res. Logist. Quart., 26: 527-535.
12. Pinedo, M. and Weiss, G., 1987. The largest variance first policy in some stochastic scheduling problems. Oper. Res., 35: 884-891.
13. Weber, R.R., 1982. Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flow time. J. Appl. Probab., 19: 167-182.
14. Weber, R.R., Varaiya, P., and Walrand, J., 1986. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. J. Appl. Probab., 23: 841-847.
15. Walpole, R. and Myers, R., 1978. Probability and Statistics for Engineers and Scientists, 2nd ed., Macmillan, New York.