Job-shop resource scheduling via simulating random operations

Mathematics and Computers in Simulation

Volumn 44, Issue 5, 1997, Pages 427-440

  Golenko Ginzburg, Dimitri ^a   Gonik, Aharon ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Luxembourg Industries   (Israel)

Author keywords

Backwards scheduling; Chance constraint; Delivery performance; Feeding in resources; Job shop scheduling

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; PRODUCTION CONTROL; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

BACKWARDS SCHEDULING; DELIVERY PERFORMANCE; FEEDING IN RESOURCES; JOB SHOP RESOURCE SCHEDULING;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0031338250     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-4754(97)00074-8     Document Type: Article

References (12)

1. E.G. Coffman, M. Hofri, G. Weiss, Scheduling stochastic jobs with a two-room distribution on two parallel machines, Probab. Engnr. Informat. Sci. 35 (1989) 164-176.
2. D. Golenko-Ginzburg, Sh. Kesler, Heuristics in industrial stochastic job-shop scheduling, Proceedings of the 8th Conference of Industrial Engineering and Management, April 20, Ben-Gurion University of the Negev, Beer-Sheva, 3.2.1., (1994), pp. 1-6.
3. D. Golenko-Ginzburg, Sh. Kesler, Z. Landsman, Industrial job-shop scheduling with random operations and different priorities, Int. J. of Prod. Econ. 40 (1995) 185-195.
4. C.C. Huang, G. Weiss, On the optimal order of M machines in tandem, Oper. Res. Lett. 9 (1990) 299-303.
5. M. Pinedo, Minimizing the expected makespan in stochastic flow shops, Oper. Res. 30 (1982) 148-162.
6. M. Pinedo, Stochastic scheduling with release dates and due dates, Oper. Res. 31 (1983) 559-572.
7. M. Pinedo, G. Weiss, Scheduling of stochastic tasks on two parallel processors, Naval Res. Logistics Quarterly 26 (1979) 527-535.
8. M. Pinedo, G. Weiss, The largest variance first policy in some stochastic scheduling problems, Oper. Res. 35 (1987) 884-891.
9. R.R. Weber, P. Varaiya, J. Warland, Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flow time, J. Appl. Probab. 23 (1986) 841-847.
10. R.R. Weber, Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan of flow times, J. Appl. Probab. 19 (1982) 167-182.
11. C. White, N.A.J. Hastings, Scheduling the factory of the future. Paper presented to the 27th International Meeting of the Institute of Management Sciences (TIMS), July 1986.
12. C. White, Factory control systems. Graduate School of Management, Faculty of Economics and Politics, Monash University, Clayton, Victoria, Australia (internal report).