DATA STRUCTURE AND ALGORITHM FOR LARGE-SCALE GENERALIZED ASSIGNMENT PROBLEM CONSIDERING PRIORITY ORDERS
In this paper, the author proposes a data structure and approximate solution for solving a large-scale gen eralized assignment problem, being a constraint satisfaction problem. To find a desired solution among many executable solutions, the proposed algorithm sets priority orders for resources and repeatedly solves an integer programming problem in order to reduce the nonexecutable sum of constraints. In method 1 and method 2, pre viously proposed by the author, the maximum value of the priority ranking of the time slots to which resources are assigned was found by making changes in steps of + 1 or - 1. In the algorithm proposed in this study, the change is made according to the dichotomy method and the maximum value is found.
assignment problem data structure priority order large-scale
Akimine Nishikori
Faculty of Management and Information Systems, Prefectural University of Hiroshima, 734 -8558, Japan
国际会议
The Ninth International Conference on Industrial Management(第九届工业管理国际会议 ICIM2008)
日本大阪
英文
706-710
2008-09-16（万方平台首次上网日期，不代表论文的发表时间）