A COMPARISON OF DISPATCHING RULES FOR JOB SHOPS WITH MULTIPLE IDENTICAL JOBS AND ALTERNATIVE ROUTEINGS

被引：43

作者：

KIM, YD

机构：

[1] Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Cheongryang, Seoul

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1990年 / 28卷 / 05期

关键词：

D O I：

10.1080/00207549008942766

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In general job shop scheduling, n jobs have to be scheduled on m machines. We consider the job shop scheduling problems in which there are orders with sizes greater than one (therefore there are multiple identical jobs), and in which each operation can be processed on several machines (therefore there are alternative routeings for the operations). These characteristics of the problems impose special precedence relationships among operations. We compare various dispatching rules for list scheduling algorithms and test several methods for defining successors of an operation using the precedence relationships. Mean tardiness, mean flow time, and number of tardy jobs are used as performance measures in the comparison. © 1990 Taylor & Francis Group, LLC.

引用

页码：953 / 962

页数：10

共 17 条

[1]

Baker K.R., Kanet J.J., Job shop scheduling with modified due dates, Journal of Operations Management, 4, 1, pp. 11-22, (1983)

[2]

Barker J.B., McMahon G.B., Scheduling the general job-shop, Management Science, 31, 5, pp. 594-598, (1985)

[3]

Berry W.L., Rao V., Critical ratio scheduling: An experimental analysis, Management Science, 22, 2, pp. 192-201, (1975)

[4]

Blackstone J.H., Phillips D.T., Hogg G.L., A state-of-the-art survey of dispatching rules for manufacturing job shop operations, International Journal of Production Research, 20, 1, pp. 27-45, (1982)

[5]

Dar-El E.M., Wysk R.A., Job shop scheduling-a systematic approach. Journal of, Manufacturing Systems, 1, 1, pp. 77-88, (1982)

[6]

Elvers D.A., Taube L.R., Time Completion for Various Dispatching Rules in Job Shops, 11, 1, pp. 81-89, (1983)

[7]

Fisher M.L., Optimal solution of scheduling problems using Lagrange multipliers, Operations Research, 21, pp. 1114-1127, (1973)

[8]

Fisher M.L., Lageweg B.J., Lenstra J.K., Rinnooy Kan A., Surrogate duality relaxation for job shop scheduling, Discrete Applied Mathematics, 5, pp. 65-75, (1983)

[9]

Kim Y.-D., On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems, International Journal of Production Research, 25, 12, pp. 1751-1759, (1987)

[10]

Lageweg B.J., Lenstra J.K., Rinnooy Kan A., Job-shop scheduling by implicit enumeration, Management Science, 24, 4, pp. 441-450, (1977)

← 1 2 →