简介:Parallelmachineproblemswithasingleserverandreleasetimesaregeneralizationsofclassicalparallelmachineproblems.Beforeprocessing,eachjobmustbeloadedonamachine,whichtakesacertainreleasetimesandacertainsetuptimes.Allthesesetupshavetobedonebyasingleserver,whichcanhandleatmostonejobatatime.Inthispaper,wecontinuestudyingthecomplexityresultforparallelmachineproblemwithasingleandreleasetimes.Newcomplexityresultsarederivedforspecialcases.