Dispatching rules for scheduling in assembly jobshops - Part 1

International Journal of Production Research

Volumn 38, Issue 9, 2000, Pages 2051-2066

  Reeja, Marath K ^a   Rajendran, Chandrasekharan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY MACHINES; COMPUTER SIMULATION; JOB ANALYSIS; SCHEDULING;

ASSEMBLY JOBSHOPS;

PRODUCTION ENGINEERING;

EID: 0034659575     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/002075400188492     Document Type: Article

References (33)

1. Adam, N.R., Bertrand, J.W.M. and Surkis, J., 1987, Priority assignment procedures in multi-level assembly jobshops, IIE Transactions, 19, 317-328.
2. Adam, N.R., Bertrand, J.W.M., Morehead, D.C. and Surkis, J., 1993, Due date assignment procedures with dynamically updated coefficients for multi-level assembly jobshops. European Journal of Operational Research, 68, 212-227.
3. Anderson, E.J. and Nyirendra, J.C., 1990, Two new rules to minimize tardiness in a jobshop. International Journal of Production Research, 28, 2277-2292.
4. Baker, K.R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
5. Baker, C.T. and Dzeilinski, B.P., 1960, Simulation of a simplified jobshop. Management Science, 6, 311-323.
6. Baker, K.R. and Kanet, J.J., 1983, Jobshop scheduling with modified due dates. Journal of Operations Management, 4, 11-22.
7. Blackstone, J.H., Phillips, D.T. and Hogg, G.L., 1982, A state-of-the-art survey of dispatching rules for manufacturing jobshop operations. International Journal of Production Research, 20, 27-45.
8. Carroll, D.C., 1965, Heuristic sequencing of single and multiple component jobs. PhD dissertation, MIT.
9. Conway, R.W., 1965, Priority dispatching and job lateness in a jobshop. Journal of Industrial Engineering, 16, 228-237.
10. Conway, R.W. and Maxwell, W.L., 1962, Network dispatching by shortest operation discipline. Operations Research, 10, 51-73.
11. Conway, R.W., Maxwell, W.L. and Miller, L.W., 1967, Theory of Scheduling (Reading, MA: Addison Wesley).
12. Goodwin, J.S. and Goodwin, J.C., 1982, Operating policies for scheduling assembled products. Decision Sciences, 13, 585-603.
13. Haupt, R., 1989, A survey of priority rule-based scheduling. OR Spektrum, 11, 3-16.
14. Holthaus, O. and Rajendran, C., 1997, Efficient dispatching rules for scheduling in a jobshop. International Journal of Production Economies, 48, 87-105.
15. Law, A.M. and Kelton, W.D., 1991, Simulation Modeling and Analysis, 2nd edn (New York: McGraw-Hill).
16. Maxwell, W.L., 1969, Priority dispatching and assembly operations in a jobshop. Rand Corporation Memorandum, 1969.
17. Maxwell, W.L. and Mehra, M., 1968, Multiple-factor rules for sequencing with assembly constraints. Naval Research Logistics Quarterly, 15, 241-254.
18. Montgomery, D.C., 1991, Design and Analysis of Experiments, 3rd edn (New York: Wiley).
19. Nanot, Y.R., 1963, An experimental investigation and comparative evaluation of priority disciplines in jobshop-like queuing networks. Management Sciences Research Project, UCLA Research Report No. 87.
20. Philipoom, P.R., Russell, R.S. and Fry, T.D., 1991, A preliminary investigation of multi-attribute based sequencing rules for assembly shops. International Journal of Production Research, 29, 739-753.
21. Raghu, T.S. and Rajendran, C., 1993, An efficient dynamic dispatching rule for scheduling in a jobshop. International Journal of Production Economics, 32, 301-313.
22. Rajendran, C. and Holthaus, O., 1999, A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research, 116, 156-170.
23. Ramasesh, R., 1990, Dynamic jobshop scheduling: a survey of simulation research. OMEGA, 16, 43-57.
24. Rochette, R. and Sadowski, R.P., 1976, A statistical comparison of the performance of simple dispatching rules for a particular set of jobshops. International Journal of Production Research, 14, 63-75.
25. Roman, D.B. and Del Valle, A.G., 1996, Dynamic assignation of due-dates in an assembly shop based in simulation. International Journal of Production Research, 34, 1539-1554.
26. Rowe, A.J., 1960, Toward a theory of scheduling. Journal of Industrial Engineering, 11, 125-136.
27. Russell, R.S. and Taylor III B.W., 1985, An evaluation of sequencing rules for an assembly shop. Decision Sciences, 16, 196-212.
28. Sculli, D., 1980, Priority dispatching rules in jobshops with assembly operations and random delays. OMEGA, 8, 227-234.
29. Siegel, G.B., 1971, An investigation of jobshop scheduling for jobs with assembly constraints. Unpublished PhD dissertation, Cornell University.
30. Smith, C.H., Minor, E.D. and Wen, H.J., 1995, Regression-based due date assignment rules for improved assembly shop performance. International Journal of Production Research, 33, 2375-2385.
31. Vepsalainen, A.P.J. and Morton, T.E., 1987, Priority rules for jobshops with weighted tardiness costs. Management Science, 33, 1035-1047.
32. Waikar, A.M., Sarkar, B.R. and Lal, A.M., 1995, A comparative study of some priority dispatching rules under different shop loads. Production Planning & Control, 6, 301-310.
33. Wilbrecht, J.K. and Prescott, W.R., 1969, The influence of setup time on jobshop performance. Management Science, 16, 274-280.