摘要
InordertoovercometheshortcomingoftheclassicalHungarianalgorithmthatitcanonlysolvetheproblemswherethetotalcostisthesumofthatofeachjob,animprovedHungarianalgorithmisproposedandusedtosolvetheassignmentproblemofserial-parallelsystems.Firstofall,byreplacingparalleljobswithvirtualjobs,theproposedalgorithmconvertstheserial-parallelsystemintoapureserialsystem,wheretheclassicalHungarianalgorithmcanbeusedtogenerateatemporalassignmentplanviaoptimization.Afterwards,theassignmentplanisvalidatedbycheckingwhetherthevirtualjobscanberealizedbyrealjobsthroughlocalsearching.Iftheassignmentplanisnotvalid,theconvertedsystemwillbeadaptedbyadjustingtheparametersofvirtualjobs,andthenbeoptimizedagain.Throughiterativesearching,thevalidoptimalassignmentplancaneventuallybeobtained.Toevaluatetheproposedalgorithm,thevalidoptimalassignmentplanisappliedtolaborallocationofamanufacturingsystemwhichisatypicalserial-parallelsystem.
出版日期
2016年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)