Browse > Article

The Workload Assignment Problem in consideration of the Worker Pairing and the Workload Balancing  

Shim, Dong-Hyun (Dept. of Information and Industrial Engineering, YONSEI University)
Lee, Young-Hoon (Dept. of Information and Industrial Engineering, YONSEI University)
Publication Information
IE interfaces / v.22, no.3, 2009 , pp. 263-277 More about this Journal
Abstract
This research deals with a task assignment problem to worker group which consists of one master and one assistant. Each task must be assigned to only one worker group and it is possible to make a pair of each master and each assistant to organize a worker group. A worker group may have more than one task assigned to it, but the workloads of each worker group must be balanced within the allowable range. This problem can be formulated mathematically using the Mixed Integer Programming(MIP), where the objective function is to minimize the total assignment cost. A two phase heuristic algorithm is suggested in order to find approximate solutions. The first phase is to obtain an initial solution, where the initial assignment is performed to follow the workload adjustment. In the second phase, the solution is improved through the repeated process of the exchange and the assignment adjustment. Numerical experiments have been performed to evaluate the performance of the heuristic algorithm.
Keywords
pairing exchange; heuristic algorithm; generalized assignment problem(GAP);
Citations & Related Records
연도 인용수 순위
  • Reference
1 Lee, H., An, J., and Kim, S. (1997), The Work Scheduling Scheme for MaximumWork Efficiency withWorkloads Balancing Consideration, Journal of theKoreanOperationsResearch andManagement ScienceSociety, 22(4), 115-131   ScienceOn
2 Lourenco, H. R. and Serra, D. (1998), Adaptive Approach Heuristics for the generalized assignment problem, EconomicsWorking Papers in Universitat Pompeu Fabra, 288
3 Chu, P. C. and Beasley, J. E. (1997), A genetic algorithm for the generalised assignment problem,Computers andOperationsResearch, 24(1), 17-23   DOI   ScienceOn
4 Glover, F., Hultz, J., and Klingman, D. (1979), Improved Computer-Based Planning Techniques-Part II, Interfaces, 9(4), 12-20   DOI
5 Cattrysse, D. G. and VanWassenhove, L. N. (1992), A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, 60(3), 260-272   DOI   ScienceOn
6 Pentico, D. W. (2007), Assignment problems : A golden anniversary survey, European Journal of Operational Research, 176, 774-793   DOI   ScienceOn
7 Haddadi, S. and Ouzia, H. (2004), Effective algorithm and heuristic for the generalized assignment problem, European Journal of Operational Research, 153 (1), 184-190   DOI   ScienceOn
8 French, A. P. and Wilson, J. M. (2002), Heuristic Solution Methods for the Multilevel Generalized Assignment Problem, Journal of Heuristics, 8(2), 143-153   DOI   ScienceOn
9 Lorena, L. A. N. and Narciso, M. G. (1996), Relaxation heuristics for a generalized assignment problem, European Journal of Operational Research, 91(3), 600-610   DOI   ScienceOn
10 Laguna, M., Kelly, J. P., Gonzalez-Velarde, J. L., and Glover, F. (1995), Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research, 82(1), 176-189   DOI   ScienceOn
11 Votaw D. F. and Orden, A. (1952), The personnel assignment problem, Symposium on Linear Inequalities and Programming, SCOOP 10, US Air Force, 155-163
12 Kuhn, H. W. (1955), The Hungarian method for the assignment problem, Naval Research LogisticsQuarterly, 2(1&2) 83-97   DOI
13 Osman, I. H. (1995), Heuristics for the generalised assignment problem : simulated annealing and tabu search approaches,OR Spektrum, 17(4), 211-225   DOI