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...
| Authors: | , |
|---|---|
| Format: | article |
| Publication Date: | 2006 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/6076 |
| Online Access: | https://hdl.handle.net/2117/6076 |
| Access Level: | Open access |
| Keyword: | Assembly-line methods Product rate variation problem Bottleneck assignment problem Problema de asignación Cuello de botella Problema d'assignació Coll d'ampolla PRVP Producció -- Planificació Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions |
| Summary: | 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. |
|---|