A variant of time minimizing assignment problem

DOI10.1016/S0377-2217(97)00266-XzbMath0947.90042OpenAlexW1974903461MaRDI QIDQ1303581

Shalini Arora, Munish C. Puri

Publication date: 12 November 2000

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)00266-x

zbMATH Keywords

time minimizing assignment problembottleneck assignment problemimbalanced assignment problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Assignment problems: a golden anniversary survey ⋮ An alternative approach for unbalanced assignment problem via genetic algorithm ⋮ A priority based unbalanced time minimization assignment problem ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some special cases of assignment problems
• A state-of-the-art review of parallel-machine scheduling research
• The assignment problem under categorized jobs
• A parallel branch and bound algorithm for the quadratic assignment problem
• On the quadratic assignment problem
• On the bottleneck assignment problem
• Bottleneck assignment problems under categorization
• Complexity of a 3-dimensional assignment problem
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• The Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities
• The Constrained Bottleneck Problem in Networks
• The three dimensional bottleneck assignment problem and its variants
• Resource-Constrained Assignment Scheduling
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Solving the Assignment Problem by Relaxation
• A new algorithm for the assignment problem
• Some Generalisations of the Time Minimising Assignment Problem
• On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
• On the solution of a stochastic bottleneck assignment problem and its variations
• Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
• The alternating basis algorithm for assignment problems
• Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• The assignment problem with three job categories
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: A variant of time minimizing assignment problem