Topic
Assignment problem
About: Assignment problem is a research topic. Over the lifetime, 7588 publications have been published within this topic receiving 172820 citations. The topic is also known as: marriage problem.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, an efficient iterative heuristic procedure for solving the integrated layout design and product flow assignment problem is presented, where the layout design decisions involve planar location of unequal-area machines with duplicates and product flows are assigned to machines according to the product processing routes.
45 citations
01 Aug 1993
TL;DR: A generalization of the sequential simulated annealing algorithm for combinatorial optimization problems by performing a parallel study of the current solution neighbourhood is obtained and is tested by comparing it to the sequential algorithm for two classical problems.
Abstract: In this paper we present a generalization of the sequential simulated annealing algorithm for combinatorial optimization problems. By performing a parallel study of the current solution neighbourhood we obtain an algorithm that can be very efficiently implemented on a massively parallel computer. We test the convergence and the quality of our algorithm by comparing it to the sequential algorithm for two classical problems: the minimization of an unconstrained 0–1 quadratic function and the quadratic sum assignment problem.
45 citations
TL;DR: A heuristic based on Lagrangian relaxation and problem space search to solve the generalized assignment problem (GAP) is developed and test that works well on most of the benchmark instances known and provides high-quality solutions quickly.
45 citations
TL;DR: This correspondence paper formalizes the group multirole assignment (GMRA) problem; proves the necessary and sufficient condition for the problem to have a feasible solution, provides an improved IBM ILOG CPLEX optimization package solution, and verifies the proposed solution with experiments.
Abstract: Role assignment is a critical element in the role-based collaboration process. There are many different requirements to be considered when undertaking this task. This correspondence paper formalizes the group multirole assignment (GMRA) problem; proves the necessary and sufficient condition for the problem to have a feasible solution, provides an improved IBM ILOG CPLEX optimization package solution, and verifies the proposed solution with experiments. The contributions of this paper include: 1) the formalization of an important engineering problem, i.e., the GMRA problem; 2) a theoretical proof of the necessary and sufficient condition for GMRA to have a feasible solution; and 3) an improved ILOG solution to such a problem.
45 citations
TL;DR: It is shown that the problem with a specific ordering can be formulated as an assignment problem or as a shortest-route problem for which an inspection-type solution is available.
Abstract: This paper gives a simple method for finding an optimal assignment of operations to work stations when the order of operations is specified. It is shown that the problem with a specific ordering can be formulated as an assignment problem or as a shortest-route problem for which an inspection-type solution is available. The more general problem, when it is possible to enumerate all feasible orderings of operations, can then be handled by repeating the required calculations for all such orderings.
45 citations