Level scheduling under limited resequencing flexibility

被引:8
作者
Boysen, Nils [1 ]
Fliedner, Malte [1 ]
Scholl, Armin [2 ]
机构
[1] Univ Jena, Chair Operat Management, D-07743 Jena, Germany
[2] Univ Jena, Chair Management Sci, D-07743 Jena, Germany
关键词
Mixed-model assembly line; Just-in-time; Level scheduling; Re-sequencing; MODEL ASSEMBLY LINES; TIME PRODUCTION SYSTEMS; MIXED-MODEL; ALGORITHM;
D O I
10.1007/s10696-010-9065-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A mixed-model assembly line requires the solution of a short-term sequencing problem, which decides on the succession of different models launched down the line. A famous solution approach stemming from the Toyota Production System is the so-called Level Scheduling (LS), which aims to distribute the part consumption induced by a model sequence evenly over the planning horizon. LS attracted a multitude of different researchers, who, however, invariably treat initial sequence planning where all degrees of freedom in assigning models to production cycles exist. In the real-world, conflicting objectives and restrictions of preceding production stages, i.e., body and paint shop, simultaneously need to be considered and perturbations of an initial sequence will regularly occur, so that the sequencing problem often becomes a resequencing problem. Here, a given model sequence is to be reshuffled with the help of resequencing buffers (denoted as pull-off tables). This paper shows how to adapt famous solution approaches for alternative LS problems, namely the Product-Rate-Variation (PRV) and the Output-Rate-Variation (ORV) problem, if the (re-)assignment of models to cycles is restricted by the given number of pull-off tables. Furthermore, the effect of increasing re-sequencing flexibility is investigated, so that the practitioner receives decision support for buffer dimensioning, and the ability of the PRV in reasonably approximating the more detailed ORV in a resequencing environment is tested.
引用
收藏
页码:236 / 257
页数:22
相关论文
共 29 条
[1]   Heuristics and exact algorithms for solving the Monden problem [J].
Bautista, J ;
Companys, R ;
Corominas, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (01) :101-113
[2]   The product rate variation problem and its relevance in real world mixed-model assembly lines [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) :818-824
[3]   Sequencing mixed-model assembly lines: Survey, classification and model critique [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 192 (02) :349-373
[4]   The maximum deviation just-in-time scheduling problem [J].
Brauner, N ;
Crama, Y .
DISCRETE APPLIED MATHEMATICS, 2004, 134 (1-3) :25-50
[5]  
Dhamala T. N., 2005, International Journal of Operational Research, V2, P38
[6]   A SIMPLE SEQUENCING ALGORITHM FOR MIXED-MODEL ASSEMBLY LINES IN JUST-IN-TIME PRODUCTION SYSTEMS [J].
DING, FY ;
CHENG, LP .
OPERATIONS RESEARCH LETTERS, 1993, 13 (01) :27-36
[7]  
Ding FY, 2004, INT J PROD RES, V42, P1525, DOI 10.1080/00207543310001645156
[8]   Solving symmetric mixed-model multi-level just-in-time scheduling problems [J].
Fliedner, Malte ;
Boysen, Nils ;
Scholl, Armin .
DISCRETE APPLIED MATHEMATICS, 2010, 158 (03) :222-231
[9]  
Fong-Yuen Ding, 1993, Journal of Operations Management, V11, P45, DOI 10.1016/0272-6963(93)90032-K
[10]   Least in-sequence probability heuristic for mixed-volume production lines [J].
Gusikhin, Oleg ;
Caprihan, Rahul ;
Stecke, Kathryn E. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (03) :647-673