Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A Comparison of Dispatching Rules for Auxiliary Resource Constrained Job Shop Scheduling

추가자원제약을 갖는 Job Shop 작업계획의 성능 비교

  • Bae Sang-Yun (Dept. of Management Information Systems, Jeonju Technical College)
  • 배상윤 (전주공업대학 경영정보과)
  • Published : 2005.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.

Keywords

References

  1. Anderson, E. J. and Nyirenda, J. C., 'Two New Rules to Minimize Tardiness in a Job Shop', International Journal of Production Research, Vol. 28, No. 12, pp. 2277-2292, 1990 https://doi.org/10.1080/00207549008942866
  2. Baker, K. R., Introduction to Sequencing and Schedul­ing, John Wiley & Sons Inc., New York, Ch.2-8, 1974
  3. Baker, K. R. and Bertrand, J. W., 'A Dynamic Priority Rule for Scheduling against Due Dates'. Journal of Operations Management, Vol. 3, pp. 37-42, 1982 https://doi.org/10.1016/0272-6963(82)90020-1
  4. Baker, K. R. and Kanet, J. J., 'Job Shop Scheduling with Modified Due Dates', Journal of Operations Manage­ment, Vol. 4, pp. 11-21, 1983 https://doi.org/10.1016/0272-6963(83)90022-0
  5. Conway, R. W., 'Priority Dispatching and Job Lateness in a Job Shop', Journal of Industrial Engineering, Vol. 16, No. 4, pp. 228-237, 1965
  6. Fredendall, L. D., Melnyk, S. A., and Ragatz, G., 'Information and Scheduling in A Dual Resource Constrained Job Shop', International Journal of Produc­tion Research, Vol. 34, No. 10, pp. 2783-2802, 1996 https://doi.org/10.1080/00207549608905059
  7. Gargeya, V. B. and Deane, R. H., 'Scheduling Research in Multiple Resource Constrained Job Shops : A Review and Critique', Journal of Operations Management, Vol. 34, No. 8, pp. 2077-2097, 1996
  8. Gunther, R. E., 'Server Transfer Delays in A Dual Resource Constrained Parallel Queueing System', Manage­ment Science, Vol. 25, No. 12, pp. 1245-1257, 1979 https://doi.org/10.1287/mnsc.25.12.1245
  9. Kim, Y. D., 'A Backward Approach in List Scheduling Algorithms for Multi-Machine Tardiness Problems', Computers and Operations Research, Vol. 22, No. 3, pp. 307-319, 1995 https://doi.org/10.1016/0305-0548(94)E0019-4
  10. Kim, Y. D., 'A Comparison of Dispatching Rules for Job Shops with Multiple Identical Jobs and Alternative Routeings', International Journal of Production Re­search, Vol. 28, No.5, pp. 953-962, 1990 https://doi.org/10.1080/00207549008942766
  11. Raman, N, Talbot, F. B., and Rachamadugu, R. V., 'Due Date Based Scheduling in a General Flexible Manufacturing System', Journal of Operations Manage­ment, Vol. 8, No. 2, pp. 115-132, 1989 https://doi.org/10.1016/0272-6963(89)90015-6
  12. Schultz, C. R., 'An Expediting Heuristic for the Shortest Processing Time Dispatching Rule', Interna­tional Journal of Production Research, Vol. 21, No. 1, pp. 31-41, 1989
  13. Vepsalainen, A. P. J., and Morton, T. E., 'Priority Rules for Job Shops with Weighted Tardiness Costs', Management Science, Vol. 33, No. 8, pp. 1035-1047 1987 https://doi.org/10.1287/mnsc.33.8.1035