Multiple bottleneck assignment problem

DOI10.1016/S0377-2217(97)00392-5zbMATH Open0937.90087OpenAlexW2005973146MaRDI QIDQ1806893FDOQ1806893

Authors: Abraham P. Punnen, Y. P. Aneja 

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00392-5

Recommendations

• The three dimensional bottleneck assignment problem and its variants
• The bottleneck generalized assignment problem
• The simple and multiple job assignment problems
• Publication:3471838
• Bottleneck assignment problems under categorization

zbMATH Keywords

integer programmingnetwork programmingmultiple bottleneck assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Production models (90B30)

Cites Work

• Title not available (Why is that?)
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Minimum perfect bipartite matchings and spanning trees under categorization
• On combined minmax-minsum optimization
• The multiple bottleneck transportation problem
• Categorized Assignment Scheduling: a Tabu Search Approach
• Bottleneck assignment problems under categorization
• Some Generalisations of the Time Minimising Assignment Problem

Cited In (11)

• The Multicommodity Multilevel Bottleneck Assignment Problem
• Alternate strategies for solving bottleneck assignment problems - analysis and computational results
• Assignment problems: a golden anniversary survey
• On bottleneck assignment problems under categorization.
• The three-dimensional bottleneck assignment problem with capacity constraints
• Bottleneck assignment problems under categorization
• Integer programming models for the multidimensional assignment problem with star costs
• Approximating the multi-level bottleneck assignment problem
• Optimal improvements in bottleneck systems
• Title not available (Why is that?)
• Competitive strategies for an online generalized assignment problem with a service consecution constraint

This page was built for publication: Multiple bottleneck assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806893)