A Heuristic Method for Job-Shop Scheduling with an Infinite Wait Buffer

被引：0

作者：

Zhao, Z. J. ^{[1
]}

Kim, J. ^{[2
]}

Luo, M. ^{[3
]}

Lau, H. C. ^{[4
]}

Ge, S. S. ^{[1
]}

Zhang, J. B. ^{[3
]}

机构：

[1] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore

[2] UTAC, Int Transportat & Logist, Goyang, Singapore

[3] Singapore Inst Mfg Technol, Singapore, Singapore

[4] Singapore Management Univ, Sch Informat Syst, Singapore, Singapore

来源：

2008 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2 | 2008年

关键词：

Job Shop Scheduling; Multiple Machine; infinite in-process wait buffer;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Through empirical comparison of classical Job Shop Problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the Mixed Integer Programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly better.

引用

页码：1046 / +

页数：2

共 8 条

[1] THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING
ADAMS, J
BALAS, E
ZAWACK, D
[J]. MANAGEMENT SCIENCE, 1988, 34 (03) : 391 - 401
[2] Scheduling multiprocessor tasks - An overview
Drozdowski, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 215 - 230
[3] Graham R. L., 1979, Discrete Optimisation, P287
[4] Improving scheduling robustness via preprocessing and dynamic adaptation
Kutanoglu, E
Wu, SD
[J]. IIE TRANSACTIONS, 2004, 36 (11) : 1107 - 1124
[5] Muth J.F., 1963, Industrial Scheduling
[6] MULTIPROJECT SCHEDULING WITH LIMITED RESOURCES - ZERO-ONE PROGRAMMING APPROACH
PRITSKER, AAB
WATTERS, LJ
WOLFE, PM
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (01): : 93 - 108
[7] A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
Wu, SD
Byeon, ES
Storer, RH
[J]. OPERATIONS RESEARCH, 1999, 47 (01) : 113 - 124
[8] ZHAO ZJ, 2007, P IEEE ISIC INT S IN, P446

← 1 →