Browse > Article

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

Bae Sang-Yun (Dept. of Management Information Systems, Jeonju Technical College)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.28, no.1, 2005 , pp. 140-146 More about this Journal
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
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI   ScienceOn
2 Conway, R. W., 'Priority Dispatching and Job Lateness in a Job Shop', Journal of Industrial Engineering, Vol. 16, No. 4, pp. 228-237, 1965
3 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   DOI   ScienceOn
4 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   DOI
5 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
6 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   DOI   ScienceOn
7 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   DOI   ScienceOn
8 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   DOI   ScienceOn
9 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   DOI
10 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
11 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   DOI   ScienceOn
12 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   DOI   ScienceOn
13 Baker, K. R., Introduction to Sequencing and Schedul­ing, John Wiley & Sons Inc., New York, Ch.2-8, 1974