Minimizing variation of production rates in just-in-time systems: A survey

Kubiak, Wiesław

doi:10.1016/0377-2217(93)90215-9

Cited by 159 publications

(101 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Due to its application within the well-known Toyota Production System, Level Scheduling has received widespread attention in practice (see, e.g., Duplaga et al, 1996;Monden, 1998) In this analysis the well-known objective function for the Output Rate Variation (ORV) problem is applied (Kubiak, 1993). The target consumption rate r m per station m, which is approximated by the current average part demand per cycle, is defined as:…”

Section: Interdependency Between Part Supply and Production Sequencingmentioning

confidence: 99%

Scheduling just-in-time part supply for mixed-model assembly lines

Boysen

Bock

2011

European Journal of Operational Research

View full text Add to dashboard Cite

With increasing cost competition and product variety, providing an efficient Just-inTime (JIT) supply has become one of the greatest challenges in the use of mixedmodel assembly line production systems. In the present paper, therefore, we propose a new approach for scheduling JIT part supply from a central storage center. Usually, materials are stored in boxes that are allotted to the consumptive stations of the line by forklift. For such a real-world problem, a new model, a complexity proof as well as different exact and heuristic solution procedures are provided. Furthermore, at the interface between logistics and assembly operations, strategic management implications are obtained. Specifically, basing on the new approach, it is the first time a statistical analysis is being made as to whether widespread Level Scheduling policies, which are well-known from the Toyota Production System, indeed facilitate material supply. Note that in literature it is frequently claimed that this causality exists.

show abstract

Section: Interdependency Between Part Supply and Production Sequencingmentioning

confidence: 99%

Scheduling just-in-time part supply for mixed-model assembly lines

Boysen

Bock

2011

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…They develop an assignment model to generate optimal schedules for MMALs. In another study, Kubiak (1993) reviews the research conducted on this problem. In this paper, he also discusses the research efforts related to both product-usage rate and component-usage rate variation using various objective functions such as maximum and total deviation between actual usage and the expected usage.…”

Section: Literature Reviewmentioning

confidence: 99%

Mixed-model assembly line sequencing using beam search

Erel

Göçgün

Sabuncuoğlu

2007

International Journal of Production Research

View full text Add to dashboard Cite

In today's manufacturing environments, companies have to produce a large variety of products in small quantities on a single assembly line. In this paper, we use a beam search (BS) approach to solve the model-sequencing problem of mixed-model assembly lines (MMALs). Specifically, we develop six BS algorithms for part-usage variation and load-leveling performance measures. The results of computational experiments indicate that the proposed BS methods are competitive with the well-known heuristics in the literature. A comprehensive bibliography is also provided.

show abstract

“…This problem consists in sequencing copies of different products in such a way that the actual productions are as close as possible to their ideal productions (Kubiak [2]). …”

Section: Introductionmentioning

confidence: 99%

“…Kubiak [2] has introduced the term PRVP. Kubiak and Sethi [4] and [5] have explored the minsum PRVP and demonstrated that this problem can be reduced to an assignment problem (AP) when the functions that compose the objective function are nonnegative and convex.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem

Moreno¹,

Corominas²

2006

Computers & Operations Research

View full text Add to dashboard Cite

In this paper, we consider the minmax product rate variation problem (PRVP), which consists in sequencing copies of different products on an assembly line in such a way that the maximum value of a discrepancy function between actual and ideal productions is minimum. One means of solving this problem lies in its reduction to a bottleneck assignment problem with a matrix of a special structure. To solve it, three different approaches have been adopted. These approaches exploit specific minmax PRVP matrix properties. This paper presents a computational experiment with symmetric and asymmetric objective functions and offers conclusions about the most efficient way to find optimal solutions.

show abstract

Minimizing variation of production rates in just-in-time systems: A survey

Cited by 159 publications

References 14 publications

Scheduling just-in-time part supply for mixed-model assembly lines

Scheduling just-in-time part supply for mixed-model assembly lines

Mixed-model assembly line sequencing using beam search

Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem

Contact Info

Product

Resources

About