FLOWSHOP SCHEDULING WITH FLEXIBLE PROCESSORS

被引:7
作者
LIAO, CJ
SUN, CL
YOU, WC
机构
[1] Department of Industrial Management, National Taiwan Institute of Technology, Taipei, 106, 43 Keelung Road
关键词
D O I
10.1016/0305-0548(94)00028-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a permutation flow-shop where one or more processors is flexible. Two integer programming model are developed; one is for the case where the job sequence is given and the other is for the case where the job sequence is to be determined. In the former case, a heuristic is also developed to solve large-sized problems. Computational results of the heuristic are presented.
引用
收藏
页码:297 / 306
页数:10
相关论文
共 12 条
[1]  
Fogarty D.W., 1991, CENGAGE LEARNING
[2]   USING A CATS DATABASE FOR ALTERNATIVE MACHINE LOADING [J].
HANKINS, SL ;
WYSK, RA ;
FOX, KR .
JOURNAL OF MANUFACTURING SYSTEMS, 1984, 3 (02) :115-120
[3]  
Iwata K., 1978, ANN CIRP, V27, P447
[4]  
IWATA K, 1980, ANN CIRP, V29, P335
[5]  
LIAO CJ, 1992, J OPER RES SOC, V43, P1047
[6]  
MERIDTH JR, 1987, MEASUREMENT OPERATIO
[7]   JOB SHOP SCHEDULING WITH ALTERNATIVE MACHINES [J].
NASR, N ;
ELSAYED, EA .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1990, 28 (09) :1595-1609
[8]  
NOWAZ M, 1983, OMEGA, V11, P91
[9]  
Schrage L., 1986, LINEAR INTEGER QUADR