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

DOI10.1016/j.cor.2004.08.004zbMath1079.90040OpenAlexW1973319605MaRDI QIDQ2571186

Albert Corominas, Natalia Moreno

Publication date: 1 November 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/6076

zbMATH Keywords

bottleneck assignment problemproduct rate variation problem

Mathematics Subject Classification ID

Production models (90B30) Discrete location and assignment (90B80)

Related Items (2)

Unnamed Item ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique

Cites Work

• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithm for the solution of the bottleneck assignment problem
• Modelling and solving the production rate variation problem (PRVP)
• Minimizing variation of production rates in just-in-time systems: A survey
• On a distribution problem in finite and countable sets
• A Class of New Methods for Congressional Apportionment
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Maximum matching in a convex bipartite graph
• A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem
• A Computational Analysis Of Balanced Jit Optimization Algorithms

This page was built for publication: Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem