Optimization of setup times in the furniture industry

被引:6
作者
Gawronski, Tomasz [1 ]
机构
[1] Poznan Univ Life Sci, Dept Furniture Design, PL-60637 Poznan, Poland
关键词
Dispatching rule; Dynamic scheduling; Furniture; Sequence-dependent setup; DYNAMIC JOB-SHOP; DISPATCHING RULES;
D O I
10.1007/s10479-012-1233-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The aim of this paper is to develop a scheduling policy oriented towards minimizing setup times in the made-to-order furniture industry. The task is treated as a dynamic job shop scheduling problem, with the exception that customers' orders collected over a specified period of time are combined into a production plan and released together. A simulation of a production flow based on technological routes of real subassemblies was performed. The proposed method of calculating a setup time eliminates the need to determine machine setup time matrices. Among the tested priority rules the best performance was observed in the case of the hierarchical rule that combines similar setup, the earliest due date and the shortest processing time. This rule allowed the setup time per operation to be reduced by 58 % compared to a combination of the earliest due date with the shortest setup and processing time rule and by over 70 % compared to the single shortest processing time rule.
引用
收藏
页码:169 / 182
页数:14
相关论文
共 14 条
[1]   Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis [J].
Artigues, C ;
Lopez, P ;
Ayache, PD .
ANNALS OF OPERATIONS RESEARCH, 2005, 138 (01) :21-52
[2]   A branch and bound method for the job-shop problem with sequence-dependent setup times [J].
Artigues, Christian ;
Feillet, Dominique .
ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) :135-159
[3]   Job shop scheduling with setup times, deadlines and precedence constraints [J].
Balas, Egon ;
Simonetti, Neil ;
Vazacopoulos, Alkis .
JOURNAL OF SCHEDULING, 2008, 11 (04) :253-262
[4]   Sequencing heuristic for scheduling jobs with dependent setups in a manufacturing system [J].
Chen, Wen-Jinn .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (1-2) :176-184
[5]   Job shop scheduling with separable sequence-dependent setups [J].
Choi, IC ;
Korkmaz, O .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :155-170
[6]   Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time [J].
Crauwels, HAJ ;
Potts, CN ;
VanWassenhove, LN .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :261-279
[7]   Efficient dispatching rules for dynamic job shop scheduling [J].
Dominic, PDD ;
Kaliyamoorthy, S ;
Kumar, MS .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2004, 24 (1-2) :70-75
[8]  
French S., 1982, Sequencing and Scheduling
[9]   New dispatching rules for scheduling in a job shop - An experimental study [J].
Holthaus, O ;
Rajendran, C .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 1997, 13 (02) :148-153
[10]   IMPACT OF SEQUENCE-DEPENDENT SETUP TIME ON JOB-SHOP SCHEDULING PERFORMANCE [J].
KIM, SC ;
BOBROWSKI, PM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1994, 32 (07) :1503-1520