ON THE OPTIMAL ORDER OF M-MACHINES IN TANDEM

被引:13
作者
HUANG, CC
WEISS, G
机构
[1] School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta
基金
美国国家科学基金会;
关键词
blocking; flowshop; production; stochastic scheduling;
D O I
10.1016/0167-6377(90)90023-X
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider M machines in tandem with an infinite supply of jobs and no intermediate storage, and look for the order of the machines which will maximize the throughput. We show that if processing times on the machines are comparable in the sense of likelihood ratio, then it is optimal to use slower machines in the first and last position than in the second and penultimate positions. For 3 and 4 machines this implies bowl shape order of the machines. © 1990.
引用
收藏
页码:299 / 303
页数:5
相关论文
共 9 条
[1]   OPTIMAL ISSUING POLICIES UNDER STOCHASTIC FIELD LIVES [J].
BROWN, M ;
SOLOMON, H .
JOURNAL OF APPLIED PROBABILITY, 1973, 10 (04) :761-768
[2]   FINITE QUEUES IN SERIES WITH EXPONENTIAL OR ERLANG SERVICE TIMES - A NUMERICAL APPROACH [J].
HILLIER, FS ;
BOLING, RW .
OPERATIONS RESEARCH, 1967, 15 (02) :286-&
[4]   REVERSIBILITY PROPERTY OF PRODUCTION LINES [J].
MUTH, EJ .
MANAGEMENT SCIENCE, 1979, 25 (02) :152-158
[5]   MINIMIZING THE EXPECTED MAKESPAN IN STOCHASTIC FLOW SHOPS [J].
PINEDO, M .
OPERATIONS RESEARCH, 1982, 30 (01) :148-162
[6]  
Ross Sheldon, STOCHASTIC PROCESSES
[7]  
SHANTHIKUMAR JG, COMMUNICATION
[8]   PROPERTIES OF DUALITY IN TANDEM QUEUING SYSTEMS [J].
YAMAZAKI, G ;
SAKASEGAWA, H .
ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 1975, 27 (02) :201-212
[9]  
YAMAZAKI G, 1989, JUL TIMS OSAKA INT M