Systems Engineering and Electronics

• SYSTEMS ENGINEERING • Previous Articles     Next Articles

Improved Hungarian algorithm for assignment problems of serial-parallel systems

Tingpeng Li*, Yue Li, and Yanling Qian   

  1. Science and Technology on Integrated Logistics Support Laboratory, National University of Defense Technology, Changsha 410073, China
  • Online:2016-08-24 Published:2010-01-03


In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained. To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.