a cutting plane approach for the single-product assembly system design problem

a cutting plane approach for the single-product assembly system design problem

ID:34437554

大?。?93.74 KB

頁數(shù):34頁

時(shí)間:2019-03-06

a cutting plane approach for the single-product assembly system design problem_第1頁
a cutting plane approach for the single-product assembly system design problem_第2頁
a cutting plane approach for the single-product assembly system design problem_第3頁
a cutting plane approach for the single-product assembly system design problem_第4頁
a cutting plane approach for the single-product assembly system design problem_第5頁
資源描述:

《a cutting plane approach for the single-product assembly system design problem》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在教育資源-天天文庫。

1、ACuttingPlaneApproachfortheSingle-ProductAssemblySystemDesignProblembyRaduGadidovEmeryWorldwideAirlines,Vandalia,Ohio45377and1WilbertWilhelmTexasA&MUniversity,CollegeStation77843-31311CommunicatingAuthor;e-mail:wilhelm@tamu.eduApril24,1999Abstract.Thispaperevaluatesanewbranch-an

2、d-cutapproach,establishingacomputationalbenchmarkforthesingle-product,assemblysystemdesign(SPASD)problem.Ourapproach,whichincludesaheuristic,preprocessing,andtwocut-generatingmethods,outperformedOSLinsolvingasetof102instancesoftheSPASDproblem.Theapproachisrobust;testproblemsshow

3、thatitcanbeappliedtovariationsofthegenericSPASDproblemthatweencounteredinindustry.1.IntroductionThetraditional(TypeI)assemblylinebalancing(ALB)problemistoassignasetoftaskstostations,minimizingthenumberofstationsrequiredwhileobservingtaskprecedencerelationshipsandacycletimerequir

4、ement.ThispaperdealswithanextensionoftheALBproblem,thesingle-productassemblysystemdesign(SPASD)problem.TheobjectiveofthegenericSPASDproblemistominimizethetotalcostofsystemdesign;ingeneral,thisconsistsofthefixedcostsofactivatingstationsandpurchasingmachinesandthevariablecostofass

5、emblyovertheplanninghorizon.Weassumethatallofthesecostsaredeterministicandknowninadvance.Wealsoassumethatthesetofimmediatepredecessorsforeachtaskisknown.Therequirementsarethateachtaskmustbeassignedtosomestationandthatassignmentsobservetaskprecedences.Eachtaskcanbeperformedonanyo

6、neofasetofalternativemachines,andweassumethattheprocessingtimeoneachalternativemachineisdeterministicandalsoknowninadvance.Finally,weassumethatallstationshavethesamecycletimec,whichisalsodeterministicandknown.Inaddition,thispaperdealswithtwoactualSPASDproblemsweencounteredinindu

7、stry.Thefirstallowsparallel,identicalmachinestobelocatedateachstation.Thisconfigurationallows“l(fā)ong”jobs(i.e.,withprocessingtimeslargerthanthecycletime)tobehandled.Italsoincreases1stationavailability,helpingtoaccommodateprecedencerelationships.Thesecondimposespositionalrequiremen

8、tssothattasksthatrequireprocessingfromthefronts

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫的文件,查看預(yù)覽時(shí)可能會(huì)顯示錯(cuò)亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時(shí)聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。