INTEGRATING SCHEDULING WITH BATCHING AND LOT-SIZING - A REVIEW OF ALGORITHMS AND COMPLEXITY

被引:318
作者
POTTS, CN [1 ]
VANWASSENHOVE, LN [1 ]
机构
[1] INSEAD,FONTAINEBLEAU,FRANCE
关键词
ALGORITHMS; BATCHING; COMPLEXITY; LOT-SIZING; SCHEDULING;
D O I
10.1057/jors.1992.66
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In many practical situations, batching of similar jobs to avoid set-ups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determining a schedule is a lot-sizing decision which specifies how a job is to be split. This paper proposes a general model which combines batching and lot-sizing decisions with scheduling. A review of research on this type of model is given. Some important open problems for which further research is required are also highlighted.
引用
收藏
页码:395 / 406
页数:12
相关论文
共 39 条
[1]   SCHEDULING THE OPEN SHOP TO MINIMIZE MEAN FLOW TIME [J].
ACHUGBUE, JO ;
CHIN, FY .
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) :709-720
[2]   SINGLE FACILITY MULTICLASS JOB SCHEDULING [J].
AHN, BH ;
HYUN, JH .
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) :265-272
[3]   SOLUTION PROCEDURES FOR THE LOT-STREAMING PROBLEM [J].
BAKER, KR ;
PYKE, DF .
DECISION SCIENCES, 1990, 21 (03) :475-491
[4]   FINDING AN OPTIMAL SEQUENCE BY DYNAMIC-PROGRAMMING - EXTENSION TO PRECEDENCE-RELATED TASKS [J].
BAKER, KR ;
SCHRAGE, LE .
OPERATIONS RESEARCH, 1978, 26 (01) :111-120
[5]  
BAKER KR, 1990, J MANUFACTURING OPER, V2, P199
[6]  
BRUNO J, 1978, SIAM J COMPUT, V7, P393, DOI 10.1137/0207031
[7]   SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].
BRUNO, J ;
COFFMAN, EG ;
SETHI, R .
COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387
[8]  
Conway R, 1967, THEORY SCHEDULING
[9]   BATCHING TO MINIMIZE FLOW TIMES ON ONE MACHINE [J].
DOBSON, G ;
KARMARKAR, US ;
RUMMEL, JL .
MANAGEMENT SCIENCE, 1987, 33 (06) :784-799
[10]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495