Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment

International Journal of Production Research

Volumn 37, Issue 18, 1999, Pages 4105-4117

  Shafaei, R ^a   Brunn, P ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER SIMULATION; COST EFFECTIVENESS; PROCESS CONTROL; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

JOB SHOPS; WORKSHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0033355662     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499189682     Document Type: Article

References (34)

1. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
2. Baker, K. R., 1977, An experimental study of the effectiveness of rolling schedules in produc tion planning. Decision Science, 8, 19.
3. Balas, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration algor ithm. Operations Research, 17, 941-957.
4. Balas, E., Lenstra, J. K. and Vazacopoulos, A., 1995, One machine scheduling with delayed precedence constraints. Management Science, 41, 94-109.
5. Berry, W. L. and Rao, V., 1975, Critical ratio scheduling: an experimental analysis. Management Science, 22, 192-201.
6. Blazewicz, J., Dmschke, W. and Pesch E., 1996, The job shop scheduling problem: con ventional and new solution techniques. European Journal of Operational Research, 93, 1-33.
7. Carlier, J., 1982, The one machine sequencing problem. European Journal of Operational Research, 11, 42-47.
8. Carlier, J. and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35, 164-176.
9. Carlier, J. and Pinson, E., 1990, A practical use of Jackson’s pre-emptive schedule for solving the job shop problem. Annuals of Operations Research, 26, 269-287.
10. Carlier, J. and Pinson, E., 1994, Adjustments of heads and tails for the job shop problem. European Journal of Operational Research, 78, 146-161.
11. ChrEtienne, P., Coffman, J. E., Lenstra, J. K. and Liu, Z., 1995, Scheduling Theory and its Applications (Chichester: Wiley).
12. Conway, R. W., Maxwell, W. L. and Miller, L. W., 1967, Theory of Scheduling (Reading: Addison-Wesley).
13. Daniels, R. L. and Kouvelis, P., 1995, Robust scheduling to hedge against processing times uncertainty in single stage production. Management Science, 41, 363-376.
14. Dempster, M. A. H., Lensrta, J. K. and Rinnooy, K., 1982, Deterministic and stochastic scheduling. Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, Durham, UK, pp. 6-17.
15. Dooley, K. J. and Mahmoodi, F., 1992, Identification of robust scheduling heuristics: appli cation of Taguchi methods in simulation studies. Computers and Industrial Engineering, 22, 359-368.
16. Florian, M., Trepant, P. and McMahon, G., 1971, An implicit enumeration algorithm for the machine sequencing problem. Management Science, 17, B782-B792.
17. Giffler, B. and Thompson, G. L., 1960, Algorithms for solving production scheduling prob lems. Operations Research, 8, 487-503.
18. Graves, C. S., 1981, A review of production scheduling. Operations Research, 29, 646-675.
19. Leon, V. J., Wu, S. D. and Storer R. H., 1994, Robustness measures and robust scheduling for job shops. IIE Transactions, 26, 32-43.
20. Liao, C. J. and You, C. T., 1993, An improved formulation for the job shop scheduling problem. Journal of Production Research Society, 43, 1047-1054.
21. Manne, A. S., 1960, On job shop scheduling problem. Operations Research, 8, 219-223.
22. Muhlemann, A. P., Lockett, A. G. and Farn C. K., 1982, Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research, 20, 227-241.
23. Nyirenda, C. J., 1991, Job shop scheduling to minimise tardiness. PhD thesis, University of Cambridge, UK.
24. Ovacik, I. M. and Uzsoy, R., 1994, Rolling horizon algorithms for single machine dynamic scheduling problem with sequence dependent set up times. International Journal of Production Research, 32, 1243-1263.
25. Ovacik, I. M. and Uzsoy, R., 1995, Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent set up times. International Journal of Production Research, 33, 3173-3192.
26. Ramasesh, R., 1990, Dynamic job shop scheduling: a survey of simulation research. OMEGA, 18, 43-57.
27. Russell, R. S., Darei, E. M. and Taylor, B. W., 1987, A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research, 25, 1523-1540.
28. Shafaei, R., 1997, Production scheduling with poor data. PhD thesis, UMIST, UK.
29. Shafaei, R. and Brunn, P., 1999, Workshop scheduling using practical (inaccurate) data- Part 1: The performance of heuristic scheduling rules in a dynamic job shop environ ment using a rolling time horizon approach. International Journal of Production Research, 37, 3913-3925.
30. Sun, D. and Lin, L., 1994, A dynamic job shop scheduling frame work: a backward approach. International Journal of Production Research, 32, 967-985.
31. Vepsalaninen, A. and Morton, T. E., 1988, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.
32. Wagner, H. M., 1959, An integer linear programming model for machine scheduling. Naval Research L ogistic Quarterly, 6, 131.
33. Wang, W., 1996, Advanced computing methods for production management and control. PhD thesis, UMIST, UK.
34. Yellig, E. J., and Mackulak, G. T., 1997, Robust deterministic scheduling in stochastic environments: the method of capacity hedge points. International Journal of Production Research, 35, 369-379