Improved Hungarian algorithm for assignment problems of serial-parallel systems

在线阅读 下载PDF 导出详情
摘要 InordertoovercometheshortcomingoftheclassicalHungarianalgorithmthatitcanonlysolvetheproblemswherethetotalcostisthesumofthatofeachjob,animprovedHungarianalgorithmisproposedandusedtosolvetheassignmentproblemofserial-parallelsystems.Firstofall,byreplacingparalleljobswithvirtualjobs,theproposedalgorithmconvertstheserial-parallelsystemintoapureserialsystem,wheretheclassicalHungarianalgorithmcanbeusedtogenerateatemporalassignmentplanviaoptimization.Afterwards,theassignmentplanisvalidatedbycheckingwhetherthevirtualjobscanberealizedbyrealjobsthroughlocalsearching.Iftheassignmentplanisnotvalid,theconvertedsystemwillbeadaptedbyadjustingtheparametersofvirtualjobs,andthenbeoptimizedagain.Throughiterativesearching,thevalidoptimalassignmentplancaneventuallybeobtained.Toevaluatetheproposedalgorithm,thevalidoptimalassignmentplanisappliedtolaborallocationofamanufacturingsystemwhichisatypicalserial-parallelsystem.
机构地区 不详
出版日期 2016年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)