Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach

International Journal of Production Research

Volumn 37, Issue 17, 1999, Pages 3913-3925

  Shafaei, R ^a   Brunn, P ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COST EFFECTIVENESS; DECISION MAKING; OPTIMIZATION; PERFORMANCE; PRODUCTIVITY; RESOURCE ALLOCATION;

DYNAMIC JOB SHOP ENVIRONMENT; RESCHEDULING INTERVAL; ROLLING TIME HORIZON APPROACH; SCHEDULING RULES;

SCHEDULING;

EID: 0033226070     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499189835     Document Type: Article

References (46)

1. Abdel-Wahab, H. M. and Kameda, T, 1978, Scheduling to minimise maximum cumulative cost subject to series-parallel precedence constraints. Operations Research, 26, 141-159.
2. Aggarwal, S. C. and McCart, B. A., 1974, The development and evaluation of a cost based composite scheduling rule. Naval Research Logistic Quarterly, 21, 155-169.
3. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley);
4. Baker, K. R., 1977, An experimental study of the effectiveness of rolling schedules in production planning. Decision Science, 8, 19.
5. Baker, K. R. and Peterson, D. W., 1979, An analytic framework for evaluating rolling schedules. Management Science, 25, 341-351.
6. Balas, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration algor ithm. Operations Research, 17, 941-957.
7. Balas, E., LEnstra, J. K. and Vazacopoulos, A., 1995, One machine scheduling with delayed precedence constraints. Management Science, 41, 94-109.
8. Berry, W. L. and Rao, V., 1975, Critical ratio scheduling: an experimental analysis. Management Science, 22, 192-201.
9. Blackstone, J. H., Phillips, D. H. and Hogg, G. L., 1982, A state of the art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27-45.
10. 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.
11. Brucker, P., Jurisch, B. and Sievers, B., 1994, A branch and bound algorithm for job shop scheduling problem. Discrete Applied Mathematics, 49, 107-127.
12. Carlier, J. and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35, 164-176;
13. Carlier, J. and Pinson, E., 1990, A practical use of Jackson’s pre-emptive sche dule for solving the job shop problem. Annuals of Operations Research, 26, 269-287;
14. Carlier, J. and Pinson, E., 1994, Adjustments of heads and tails for the job shop problem. European Journal of Operational Research, 78, 146-161.
15. ChrEtienne, P., Coffman, J. E., Lenstra, J. K. and Liu, Z., 1995, Scheduling Theory and its Applications (Chichester: Wiley).
16. Conway, R. W., 1965, Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16, 123.
17. Conway, R. W., Maxwell, W. L. and Miller, L. W., 1967, Theory of Scheduling (Reading: Addison Wesley).
18. 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, England, 6-17.
19. Florian, M., Trepant, P. and McMahon, G., 1971, An implicit enumeration algorithm for the machine sequencing problem. Management Science, 17, B782-B792.
20. Frederick, A. R. and White, K. P., 1988, A recent survey of production scheduling. IEEE Transactions on Systems, Man and Cybernetics, 18, 841-851.
21. French, S., 1982, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, (New York: Wiley).
22. Hoffmann, T R. and Scudder, G. D., 1983, Priority scheduling with cost considerations. International Journal of Production Research, 26, 881-889.
23. Jones, C. H., 1973, An economic evaluation of job shop dispatching rules. Management Science, 20, 293-307.
24. Lawrence, S. R., 1991, Scheduling a single machine to maximise net present values. International Journal of Production Research, 29, 1141-1160.
25. 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.
26. Manne, A. S., 1960, On job shop scheduling problem. Operations Research, 8, 219-223.
27. Morton, T. E., Lawrence, S. R., Rajagopolan, S. and Kekre, S., 1988, SCHED-STAR: a price based shop scheduling module. Journal of Manufacturing and Operation Management, 1, 131-181.
28. 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.
29. Nyirenda, C. J., 1991, Job shop scheduling to minimise tardiness. Ph.D. thesis, University of Cambridge.
30. Ovacik, I. M. and Uzsoy, R., 1994, Rolling horizon algorithms for single machine dynamic scheduling problems with sequence dependent set up times. International Journal of Production Research, 32, 1243-1263.
31. 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.
32. Ramasesh, R., 1990, Dynamic job shop scheduling: a survey of simulation research. OMEGA, 18, 43-57.
33. Rinnody, K., 1976, Machine Scheduling Problems: Classifications, Complexity and Computations (The Hague: Nijhoff).
34. Rohlder, T. R., 1992, An economic analysis of scheduling in a dynamic job shop. Ph.D. thesis, University of Minnesota, Minneapolis, MN.
35. Rohlder, T. R. and Scudder, G. D., 1993, Comparing performance measures in dynamic job shops: economics vs. time. International Journal of Production Economics, 32, 160 183.
36. 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.
37. Scudder, G. D. and Smith, D., 1989a, Application of net present value criterion in random and flow shop scheduling. Decision Sciences, 20, 602-622.
38. Scudder, G. D. and Hoffmann, T. R., 1989b, The use of value based priorities when early shipments are forbidden. International Journal of Production Research, 27, 353-369.
39. Shafaei, R., 1997, Production scheduling with poor data. Ph.D. thesis, UMIST, England.
40. Smith-Daniels, D. E. and Aquilano, N. J., 1987, Using a late start resource-constrained project schedule to improve project net present value. Decision Sciences, 18, 617-630.
41. Smith-Daniels, D. E. and Smith-Daniel, V. L., 1987, Maximising the net present value of a project subject to material and capital constraints. Journal of Operations Management, 17, 33-46.
42. Sun, D. and Lin, L., 1994, A dynamic job shop scheduling frame work: a backward approach. International Journal of Production Research, 32, 967-985.
43. Vepsalaninen, A. and Morton, T. E., 1988, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.
44. Wagner, H. M., 1959, An integer linear programming model for machine scheduling. Naval Research Logistic Quarterly, 6, 131.
45. Wang, W., 1996, Advanced computing methods for production management and control. PhD thesis, UMIST, UK
46. Wilson, H. G. and Mardis, B. J., 1983, Modifying job sequence rules for work in process inventory reduction. IIE Transactions, 15, 320-323.