Impact of throughput-based objectives and machine grouping decisions on the short-term performance of flexible manufacturing systems

被引:17
作者
Kim, YD [1 ]
Yano, CA [1 ]
机构
[1] KOREA ADV INST SCI & TECHNOL, DEPT IND ENGN, YUSONG GU, TAEJON 305701, SOUTH KOREA
关键词
D O I
10.1080/002075497194084
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The most commonly-used objective in the literature for solving machine loading and grouping problems in flexible manufacturing systems is the maximization of steady-state throughput. In reality, orders arrive dynamically and the mix of products changes frequently, raising questions about the applicability of this objective in achieving shorter-term measures of the output rate. Moreover, the loading and grouping problems only determine which operations are to be performed on each machine, and whether any of the machines should be identically tooled so as to allow multiple routeings for some jobs. The actual short-term performance of the system also depends on scheduling and dispatching decisions. We study the impact of the various objectives ostensibly related to steady-state throughput and machine grouping decisions on the short-term makespan performance (in a static setting). Computational results suggest that minimizing the maximum percentage overload (relative to the optimal continuous workload allocation) across machine groups is an excellent objective. The results also indicate that reducing the number of machine groups and balancing workloads among the machines help to reduce makespan.
引用
收藏
页码:3303 / 3322
页数:20
相关论文
共 41 条
[1]  
AMMONS JC, 1985, ANN OPER RES, V3, P319
[2]   A BRANCH AND BOUND APPROACH FOR MACHINE LOAD BALANCING IN FLEXIBLE MANUFACTURING SYSTEMS [J].
BERRADA, M ;
STECKE, KE .
MANAGEMENT SCIENCE, 1986, 32 (10) :1316-1335
[3]   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
[4]  
BUZACOTT J, 1992, DESIGN MANUFACTURING
[5]   ON APPROXIMATE QUEUING MODELS OF DYNAMIC JOB SHOPS [J].
BUZACOTT, JA ;
SHANTHIKUMAR, JG .
MANAGEMENT SCIENCE, 1985, 31 (07) :870-887
[6]  
CHAKRAVARTY AK, 1984, 1ST P ORSA TIMS C FM, P284
[7]  
CHAO LL, 1974, STAT INTUITIVE APPRO
[8]   ON THE OPTIMAL ALLOCATION OF SERVERS AND WORKLOADS IN CLOSED QUEUING-NETWORKS [J].
DALLERY, Y ;
STECKE, KE .
OPERATIONS RESEARCH, 1990, 38 (04) :694-703
[9]   A MIXED INTEGER-PROGRAM FOR LOADING AND SCHEDULING MULTIPLE FLEXIBLE MANUFACTURING CELLS [J].
GREENE, TJ ;
SADOWSKI, RP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (03) :379-386
[10]  
GURNANI H, 1991, J MANUF SYST, V10, P422, DOI 10.1016/0278-6125(91)90059-B