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: The results convincingly show that the DR-SMSP model is able to enhance the robustness of the optimal job sequence and achieve risk reduction with a small sacrifice on the optimality of the mean value.
56 citations
18 Aug 2009
TL;DR: This paper presents a new data-parallel approach for computing bipartite graph matching that is efficiently computed on today's graphics hardware and applies it to solve the correspondence between 3D samples taken over a time interval.
Abstract: The Bipartite Graph Matching Problem is a well studied topic in Graph Theory. Such matching relates pairs of nodes from two distinct sets by selecting a subset of the graph edges connecting them. Each edge selected has no common node as its end points to any other edge within the subset. When the considered graph has huge sets of nodes and edges the sequential approaches are impractical, specially for applications demanding fast results. In this paper we investigate how to compute such matching on Graphics Processing Units (GPUs) motivated by its increasing processing power made available with decreasing costs. We present a new data-parallel approach for computing bipartite graph matching that is efficiently computed on today's graphics hardware and apply it to solve the correspondence between 3D samples taken over a time interval.
56 citations
TL;DR: In this paper, a tabu search algorithm is proposed to improve the solution for medium and large sized problems in an automated storage/retrieval system with duration-of-stay based shared storage policy.
Abstract: Storage location assignment and interleaving policy are two closely related problems in warehousing management. This paper addresses the location assignment and interleaving problem at the same time in an automated storage/retrieval system with duration-of-stay based shared storage policy. Based on the heuristics for single command operation, a two-step procedure is developed to solve the problem. A tabu search algorithm is proposed to improve the solution for medium and large sized problems. The computational results indicate that the tabu search algorithm is effective in finding high quality solutions, and efficient in solving large sized problems.
56 citations
02 Aug 2001
TL;DR: A CBR system is developed using the similarity coefficient of each order with previous orders to solve the due-date assignment problem of the wafer fabrication factory and results show that the proposed approach is very effective and comparable with a neural network approach.
Abstract: This study explores a new application of Case-Based Reasoning (CBR) in the due-date assignment problem of the wafer fabrication factory. Owing to the complexity of the wafer fabrication, the manufacturing processes of the wafer are very complicated and time-consuming. Thus, the due-date assignment of each order presents a challenging problem to the production planning and scheduling people. Since the product of each order is closely related to the products manufactured before, the CBR approach provides a good tool for us to apply it to the due-date assignment problem. The CBR system could potentially replace the human decision in the estimation of the due-date. Therefore, a CBR system is developed in this study using the similarity coefficient of each order with previous orders. The experimental results show that the proposed approach is very effective and comparable with a neural network approach.
56 citations
TL;DR: In this article, the problem of assigning classes to professors, in such a way that the average number of distinct subjects assigned to each professor is minimized, is formulated as a mixed integer program.
56 citations