산업공학 (IE interfaces)

  • 제22권3호
  • /
  • Pages.263-277
  • /
  • 2009
  • /
  • 1225-0996(pISSN)
  • /
  • 2234-6465(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

작업조 구성과 작업량 평준화를 고려한 작업할당문제에 관한 연구

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)
  • 투고 : 2008.12.01
  • 심사 : 2009.08.17
  • 발행 : 2009.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. 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 https://doi.org/10.1016/0377-2217(92)90077-M
  2. Chu, P. C. and Beasley, J. E. (1997), A genetic algorithm for the generalised assignment problem,Computers andOperationsResearch, 24(1), 17-23 https://doi.org/10.1016/S0305-0548(96)00032-9
  3. French, A. P. and Wilson, J. M. (2002), Heuristic Solution Methods for the Multilevel Generalized Assignment Problem, Journal of Heuristics, 8(2), 143-153 https://doi.org/10.1023/A:1017900606269
  4. Glover, F., Hultz, J., and Klingman, D. (1979), Improved Computer-Based Planning Techniques-Part II, Interfaces, 9(4), 12-20 https://doi.org/10.1287/inte.9.4.12
  5. Haddadi, S. and Ouzia, H. (2004), Effective algorithm and heuristic for the generalized assignment problem, European Journal of Operational Research, 153(1), 184-190 https://doi.org/10.1016/S0377-2217(02)00710-5
  6. Kuhn, H. W. (1955), The Hungarian method for the assignment problem, Naval Research LogisticsQuarterly, 2(1&2) 83-97 https://doi.org/10.1002/nav.3800020109
  7. 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 https://doi.org/10.1016/0377-2217(93)E0174-V
  8. 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
  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 https://doi.org/10.1016/0377-2217(95)00041-0
  10. Lourenco, H. R. and Serra, D. (1998), Adaptive Approach Heuristics for the generalized assignment problem, EconomicsWorking Papers in Universitat Pompeu Fabra, 288
  11. Osman, I. H. (1995), Heuristics for the generalised assignment problem : simulated annealing and tabu search approaches,OR Spektrum, 17(4), 211-225 https://doi.org/10.1007/BF01720977
  12. Pentico, D. W. (2007), Assignment problems : A golden anniversary survey, European Journal of Operational Research, 176, 774-793 https://doi.org/10.1016/j.ejor.2005.09.014
  13. Votaw D. F. and Orden, A. (1952), The personnel assignment problem, Symposium on Linear Inequalities and Programming, SCOOP 10, US Air Force, 155-163