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

Authors:
Natalia Moreno;Albert Corominas
Affiliations:
Department of Business, Faculty of Business Administration, Universitat Politècnica de Catalunya, MUN, St. John's, Spain;Institute of Control and Industrial Engineering, Universitat Politècnica de Catalunya, Spain
Venue:
Computers and Operations Research
Year:
2006

Citing 6
Cited 0

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
A note on “level schedules for mixed-model assembly lines in just-in-time production systems”

Management Science
Level schedules for mixed-model, Just-in-Time processes

Management Science
Algorithms and codes for dense assignment problems: the state of the art

Discrete Applied Mathematics
The maximum deviation just-in-time scheduling problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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.