MINIMIZING VARIATION OF PRODUCTION-RATES IN JUST-IN-TIME SYSTEMS - A SURVEY

被引:125
作者
KUBIAK, W
机构
[1] Faculty of Business Administration, Memorial University of Newfoundland, St. John's
基金
加拿大自然科学与工程研究理事会;
关键词
PRODUCTION; SCHEDULING; JUST-IN-TIME; NONLINEAR INTEGER PROGRAMMING; MIXED-MODEL ASSEMBLY LINES; ALGORITHMS; COMPUTATIONAL COMPLEXITY;
D O I
10.1016/0377-2217(93)90215-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In the past several years, there has been growing interest in scheduling problems where jobs are penalized both for being early and for being tardy. This notable deviation from previous work, in which finishing early is generally regarded as being at least as desirable as finishing on time, is perceived to be the one that well captures the scheduling dimension of JIT production systems. A number of excellent surveys on these problems has appeared over the last four years. There is, however, another important scheduling objective in JIT production systems which is to minimize variation of rates at which processes supply their outputs. These scheduling problems are, for example, of primary concern in the Toyota JIT system. Thus far, most research efforts in this area have been focused on minimizing variation of the rate at which different products are being produced on the final, multi-model assembly line which itself is a supplying process. We shall review the results of this research, and relate them to the due date based scheduling problems. Extensions and open problems will also be reviewed. Schedules that minimize variation of the rate at which different products are being produced on the line do not necessarily minimize variation in the line demand for outputs of processes that supply it. Few heuristics for the problem of minimizing the variation are available and hardly anything is known on its complexity as wel as exact algorithms to tackle it. We shall review a mathematical programming model of the problem and open questions that result from it.
引用
收藏
页码:259 / 271
页数:13
相关论文
共 24 条
[1]   SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].
BAKER, KR ;
SCUDDER, GD .
OPERATIONS RESEARCH, 1990, 38 (01) :22-36
[2]  
BALAS E, 1989, MSRR552 GSIA CARN U
[3]  
BURKARD RE, 1980, MATH PROGRAM STUD, V12, P1, DOI 10.1007/BFb0120884
[4]  
BURKARD RE, 1980, ASSIGNMENT MATCHING
[5]   SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].
CHENG, TCE ;
GUPTA, MC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166
[6]  
DERIGS U, 1984, GRAPH THEORETIC CONC, P79
[7]   SCHEDULING UNIT-TIME TASKS WITH INTEGER RELEASE TIMES AND DEADLINES [J].
FREDERICKSON, GN .
INFORMATION PROCESSING LETTERS, 1983, 16 (04) :171-173
[8]   ONE-PROCESSOR SCHEDULING WITH SYMMETRIC EARLINESS AND TARDINESS PENALTIES [J].
GAREY, MR ;
TARJAN, RE ;
WILFONG, GT .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :330-348
[9]  
Garey MR., 1979, COMPUTERS INTRACTABI
[10]  
GLOVER F, 1967, NAV RES LOG, V4, P313