Efficient dispatching rules for dynamic job shop scheduling

被引:95
作者
Dominic, PDD [1 ]
Kaliyamoorthy, S
Kumar, MS
机构
[1] Reg Engn Coll, Dept Management Studies, Tiruchirappalli 620015, Tamil Nadu, India
[2] Alagappa Univ, Alagappa Inst Management, Karaikkudi 630004, Tamil Nadu, India
[3] Natl Univ Singapore, Dept Mech Engn, Singapore 117548, Singapore
关键词
dynamic job shop; dispatching rules; combination rules; tardiness; flow time; computer simulation;
D O I
10.1007/s00170-002-1534-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This study attempts to provide efficient dispatching rules for dynamic job shop scheduling by combining different dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. A job shop will be treated as dynamic, when conditions such as continuously arriving new jobs and deviations from current schedule need to be accommodated, and a job shop should be treated as an integrated part of a manufacturing system. The discussion includes a simulation technique which uses ARENA 4.0. software to simulate the dynamic model of a job shop under various rules and performance measures . Results of the simulation show that, for most of the performance measures, combined rules perform well. In this study, the combined rules MWKR_FIFO and TWKR_SPT do well under most conditions.
引用
收藏
页码:70 / 75
页数:6
相关论文
共 19 条
[1]  
[Anonymous], AIIE T
[2]   SEQUENCING RULES AND DUE-DATE ASSIGNMENTS IN A JOB SHOP [J].
BAKER, KR .
MANAGEMENT SCIENCE, 1984, 30 (09) :1093-1104
[3]  
Baker KR., 1974, Introduction to Sequencing and Scheduling
[4]   Order review and release strategies in a job shop environment: A review and a classification [J].
Bergamaschi, D ;
Cigolini, R ;
Perona, M ;
Portioli, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (02) :399-420
[5]   A STATE-OF-THE-ART SURVEY OF DISPATCHING RULES FOR MANUFACTURING JOB SHOP OPERATIONS [J].
BLACKSTONE, JH ;
PHILLIPS, DT ;
HOGG, GL .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1982, 20 (01) :27-45
[6]   A DYNAMIC FORECASTING-MODEL FOR JOB-SHOP FLOWTIME PREDICTION AND TARDINESS CONTROL [J].
ENNS, ST .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1995, 33 (05) :1295-1312
[7]   ESTIMATING SAMPLE SIZE IN COMPUTING SIMULATION EXPERIMENTS [J].
FISHMAN, GS .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (01) :21-38
[8]  
HAUPT R, 1989, OR SPEKTRUM, V11, P3
[9]   ALTERNATIVE FORMULATION OF JOB SHOP PROBLEM WITH DUE DATES [J].
HOLLOWAY, CA ;
NELSON, RT .
MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 20 (01) :65-75
[10]   Efficient dispatching rules for scheduling in a job shop [J].
Holthaus, O ;
Rajendran, C .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (01) :87-105