A look-ahead routing procedure for machine selection in a highly informative manufacturing system

被引:7
作者
Jang, JJ [1 ]
Suh, JD
Park, N
Liu, R
机构
[1] Hankuk Univ Foreign Studies, Dept Ind Engn, Yongin 449791, South Korea
[2] Kyungwon Univ, Dept Ind Engn, Seongnam 461701, South Korea
[3] Korea Inst Ind Technol, Mfg & Informat Syst Div, Cheonan, South Korea
[4] Purdue Univ, Sch Ind Engn, W Lafayette, IN 47907 USA
来源
INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS | 2001年 / 13卷 / 03期
关键词
highly informative manufacturing system; FMS; look-ahead; routing; simulation;
D O I
10.1023/A:1011199619582
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a highly informative manufacturing system (HIMS) has added a new requirement to a classical job-shop control problem: the selection of machines by parts of different types. An HIMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future with great accuracy, which can be used for shop floor control. For example, the knowledge of the time when the next parts arrive at the machines can be used for better routing. This article tests the effect of the use of this knowledge for part routing on the part's flow time and tardiness under a look-ahead routing procedure (LARP). LARP assigns a new part to a machine so that the assignment minimizes the flow time or tardiness of the current part and the next N parts arriving after the current part. A test shows that the reduction of part flow time is up to 11% and the reduction of tardiness is up to 21% for the cases with this procedure.
引用
收藏
页码:287 / 308
页数:22
相关论文
共 33 条
[1]   Scheduling of flexible flow lines in an automobile assembly plant [J].
Agnetis, A ;
Pacifici, A ;
Rossi, F ;
Lucertini, M ;
Nicoletti, S ;
Nicolo, F ;
Oriolo, G ;
Pacciarelli, D ;
Pesaro, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 97 (02) :348-362
[2]  
AGNETIS A, 1993, P 12 TRIENN WORLD C, P18
[3]  
[Anonymous], 1987, TRAFFIC PROCESSES QU
[4]  
Baker KR., 1974, Introduction to Sequencing and Scheduling
[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]   INTELLIGENT DISPATCHING FOR FLEXIBLE MANUFACTURING [J].
CHANDRA, J ;
TALAVAGE, J .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (11) :2259-2278
[7]  
DOULGERI Z, 1987, ANN CIRP, V36, P343
[8]  
ENGELL S, 1990, PROCEEDINGS OF THE 29TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, P125, DOI 10.1109/CDC.1990.203558
[9]   DYNAMIC BATCHING HEURISTIC FOR SIMULTANEOUS PROCESSING [J].
GLASSEY, CR ;
WENG, WW .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 1991, 4 (02) :77-82
[10]  
Green GaryI., 1981, J OPERATIONS MANAGEM, V1, P197