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

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.

[1]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[2]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[3]  Robert Tijdeman.  On a Distribution Problem in Finite and Countable Sets , 1973, J. Comb. Theory, Ser. A.

[4]  W. Kubiak.  Minimizing variation of production rates in just-in-time systems: A survey☆ , 1993 .

[5]  G. Steiner,et al.  Level Schedules for Mixed-Model, Just-in-Time Processes , 1993 .

[6]  Paolo Toth,et al.  Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..

[7]  Suresh P. Sethi,et al.  Optimal just-in-time schedules for flexible transfer lines , 1994 .

[8]  S. Sethi,et al.  A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems" , 1991 .

[9]  Michel Balinski,et al.  Fair Representation in the European Parliament , 1982 .

[10]  Wieslaw Kubiak,et al.  A Computational Analysis Of Balanced Jit Optimization Algorithms , 2001 .

[11]  Graham K. Rand,et al.  Operations Research for Immediate Application: A Quick and Dirty Manual , 1975 .

[12]  Natalia Moreno Palli.  Solving the product rate variation problem (prvp= of large dimensions as an assignment problem) , 2002 .

[13]  Yves Crama,et al.  The maximum deviation just-in-time scheduling problem , 2004, Discret. Appl. Math..

[14]  Paolo Toth,et al.  Algorithm for the solution of the Bottleneck Assignment Problem , 2005, Computing.

[15]  Joaquín Bautista,et al.  A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem , 1996 .

[16]  N. BRAUNER,et al.  Facts and questions about the maximum deviation just-intime scheduling problem , .

[17]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[18]  John B. Kidd,et al.  Toyota Production System , 1993 .

[19]  Joaquín Bautista,et al.  Modelling and solving the production rate variation problem (PRVP) , 1997 .

[20]  Jonathan W. Still.  A Class of New Methods for Congressional Apportionment , 1979 .