Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs

International Journal of Production Research

Volumn 41, Issue 18, 2003, Pages 4453-4486

  Thiagarajan, S ^a   Rajendran, C ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COSTS; CUSTOMER SATISFACTION; DECISION MAKING;

ASSEMBLY OPERATIONS; TARDINESS COST;

SCHEDULING;

EID: 0344152920     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540310001595864     Document Type: Article

References (35)

1. 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 job-shops. European Journal of Operational Research, 68, 212-227.
2. ADAM, N. R., BERTRAND, J. W. M. and SURKIS, J., 1987, Priority assignment procedures in multi-level assembly job shops. IIE Transactions, 19, 317-328.
3. BAKER, C. T. and DZEILINSKI, B. P., 1960, Simulation of a simplified job-shop. Management Science, 6, 311-323.
4. BLACKSTONE, J. H., PHILLIPS, D. T. 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.
5. CONWAY, R. W., JOHNSON, B. M. and MAXWELL, W. L., 1960, An experimental investigation of priority dispatching. Journal of Industrial Engineering, 11, 221-230.
6. DAY, J. E. and HOTTENSTEIN, M. P., 1970, Review of sequencing research. Naval Research Logistics Quarterly, 17, 11-39.
7. FRAMINAN, J. M., RUIZ-USANO, R. and LEISTEN, R., 2001, Sequencing CONWIP flow-shops: analysis and heuristics. International Journal of Production Research, 39, 2735-2749.
8. FRY, T. D., OLIFF, M. D., MINOR, E. D. and LEONG, G. K., 1989, The effects of product structure and sequencing rule on assembly shop performance. International Journal of Production Research, 27, 671-686.
9. GOODWIN, J. S. and GOODWIN, J. C., 1982, Operating policies for scheduling assembled products. Decision Sciences, 13, 585-603.
10. HAUPT, R., 1989, A survey of priority rule based scheduling. OR spectrum, 11, 3-16.
11. HOFFMAN, T. R. and SCUDDER, G. D., 1983, Priority scheduling with cost considerations. International Journal of Production Research, 21, 881-889.
12. HOLTHAUS, O. and RAJENDRAN, C., 1997, Efficient dispatching rules for scheduling in a job-shop. International Journal of Production Economics, 48, 87-105.
13. HOLTHAUS, O. and RAJENDRAN, C., 2000, Efficient job-shop dispatching rules: further developments. Production Planning and Control, 11, 171-178.
14. HOLTHAUS, O. and RAJENDRAN, C., 2002, A study on the performance of scheduling rules in buffer-constrained dynamic flowshops. International Journal of Production Research, 40, 3041-3052.
15. HOLTHAUS, O. and ZIEGLER, H., 1997, Improving job-shop performance by coordinating dispatching rules. International Journal of Production Research, 35, 539-549.
16. JAYAMOHAN, M. S. and RAJENDRAN, C., 2000, New dispatching rules for job-shop scheduling: a step toward. International Journal of Production Research, 38, 563-586.
17. JENSEN, J. B., PHILIPOOM, P. R. and MALHOTRA, M. K., 1995, Evaluation of scheduling rules with commensurate customer priorities in job shops. Journal of Operations Management, 13, 213-228.
18. LAW, A. M. and KELTON, W. D., 1984, Confidence intervals for steady-state simulation: I. A survey of fixed sample survey procedures. Operations Research, 32, 1221-1239.
19. LORENZEN, T. J. and ANDERSON, V. L., 1993, Design of Experiments: A No-Name Approach (New York: Marcel Dekker).
20. MAXWELL, W. L. and MEHRA, M., 1968, Multiple-factor rules for sequencing with assembly constraints. Naval Research Logistics Quarterly, 15, 241-254.
21. MONTGOMERY, D. C., 1991, Design and Analysis of Experiments, 3rd edn (New York: Wiley).
22. PHILLIPOOM, P. R., MARKLAND, R. E. and FRY, T. D., 1989, Sequencing rules, progress milestones, and product structure in a multistage job shop. Journal of Operations Management, 8, 209-229.
23. PHILLIPOOM, 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.
24. PLOSSL, G. W., 1980, MRP yesterday, today, and tomorrow. Production and Inventory Management, Third Quarter, 1-10.
25. RAMASESH, R., 1990, Dynamic job shop scheduling: a survey of simulation research, OMEGA, 16, 43-47.
26. REEJA, M. K. and RAJENDRAN, C., 2000a, Dispatching rules for scheduling in assembly job shops - Part I. International Journal of Production Research, 38, 2051-2066.
27. REEJA, M. K. and RAJENDRAN, C., 2000b, Dispatching rules for scheduling in assembly job shops - Part II. International Journal of Production Research, 38, 2349-2360.
28. ROWE, A. J., 1960, Toward a theory of scheduling. Journal of Industrial Engineering, 11, 125-136.
29. RUSSELL, R. S., DAR-EL, E. M. and TAYLOR III, B. W., 1987, A comparative analysis of the COVERT job sequencing rule using various shop performance parameters. International Journal of Production Research, 25, 1523-1540.
30. RUSSELL, R. S. and TAYLOR III, B. W., 1985, An evaluation of sequencing rules for an assembly shop. Decision Sciences, 16, 196-212.
31. SCUDDER, G. D. and HOFFMAN, T. R., 1987, The use of cost-based priorities in random and flow shops. Journal of Operations Management, 7, 217-232.
32. SCULLI, D., 1980, Priority dispatching rules in job shops with assembly operations and random delays. OMEGA, 8, 227-234.
33. SCULLI, D., 1987, Priority dispatching rules in an assembly job shop. OMEGA, 15, 49-57.
34. VEPSALAINEN, A. P. J. and MORTON, T. E., 1987, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.
35. YANG, K. K. and SUM, C. C., 1994, A comparison of job shop dispatching rules using a total cost criterion. International Journal of Production Research, 32, 807-820.