Robustness measures and robust scheduling for job shops

IIE Transactions (Institute of Industrial Engineers)

Volumn 26, Issue 5, 1994, Pages 32-43

  Leon, V Jorge ^a   Wu, S David ^b   Storer, Robert H ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INDUSTRIAL PLANTS; MACHINERY; PERFORMANCE; PLANNING; PRODUCTION; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS);

GENETIC ALGORITHM; JOB SHOPS; RIGHT SHIFT CONTROL POLICY; ROBUST SCHEDULING;

SCHEDULING;

EID: 0028499648     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179408966626     Document Type: Article

References (20)

1. Adams, J., BaJas, E., and Zawack, D., “The Shifting Bottleneck Procedure for Job Shop Scheduling,“ Management Science. 34, 3, 391-401 (1988).
2. Balas, E., Proceedings of the NATO Conference in Applications of Mathematical Programming, Cambridge (England), 24-28 (June 1968).
3. Balas, E., “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm,” Operations Research, 17, 941-957 (1969).
4. Bean, J. C., Birge, J. R., Mittenthal, J., and Noon, C. E. “Match-Up Scheduling with Multiple Resources, Release Dates and Disruptions,” Operations Research, Vol. 39, No. 3, 470-483.
5. Florian, M., Trepant, P., and McMahon, G., “An Implicit Enumeration Algorithm for the Machine Sequencing Problem," Management Science. Vol. 17, No. 12 (1971).
6. Gittins, J. C., and Glazebrook, K. D. “On Bayesian Models In Stochastic Scheduling,” Journal of Applied Probabilities, Vol. 14, 556-565 (1977).
7. Gittins, J. C, “Bandit Processes and Dynamic Allocation Indices,” J. R. Statist. Soc. B, Vol. 41, No. 2, 148-177 (1979).
8. Glazebrook, K. D., “On Non-Preemptive Strategies in Stochastic Scheduling,” Naval Research Logistics Quarterly, Vol. 28, 289-300 (1981).
9. Glazebrook, K. D. “Scheduling Stochastic Jobs in a Single Machine Subject to Breakdowns, ’ Naval Research Logistics Quarterly, Vol. 31 (1984).
10. Glazebrook, K. D., “Semi-Markov Models for Single-Machine Stochastic Scheduling Problems,” Int. J. Sys. Sci., Vol. 16, No. 5, 573-587 (1985).
11. Glazebrook, K. D., “Evaluating the Effects of Machine Breakdowns in Stochastic Scheduling Problems,” Naval Research Logistics, Vol. 34 (1987).
12. Giffler, B., and Thompson, G. L., “Algorithms for Solving Production Scheduling Problems," Operations Research, Vol. 8. No. 4 (I960).
13. Graves, C. S., “A Review of Production Scheduling,” Operations Research, Vol. 29, 1981, pp. 646-675.
14. Muth, J. F., and Thompsom, G. L., Industrial Scheduling, Prentice-Hall, Englewood Cliffs, N. J. (1963).
15. Pinedo, M., and Ross, S., “Scheduling Jobs Subject to NonHomogeneous Poisson Shocks,” Management Science, Vol. 26, 1250-1257 (1980).
16. Pinedo, M., “Stochastic Scheduling With Release Dates and Due Dates,” Operations Research, Vol. 31, 559-572 (1983).
17. Roundy, R., Hcrcr, Y., and Tayur, S., “Price-Directed Scheduling of Production Operations in Real Time,” Proc. 15th Conference of the NSF Production Research and Technology Program, Berkeley, CA (1989).
18. Storer, R. H., Wu, D. D., and Vaccari, R., “Local Search in Problem and Heuristic Space For Job Shop Scheduling,” Management Science, to appear.
19. Wagner, H. M., and Within, T., “Dynamic Version of the Economic Lot Size Model," Management Science, Vol. 5, 89-96 (1958).
20. Yamamoto, M., and Nof, S. Y., “Scheduling/Rescheduling in the Manufacturing Operating System Environment,” International Journal of Production Research, Vol. 23, No. 4, 705-722 (1985).