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

大小:193.74 KB

页数:34页

时间: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》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

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“long”jobs(i.e.,withprocessingtimeslargerthanthecycletime)tobehandled.Italsoincreases1stationavailability,helpingtoaccommodateprecedencerelationships.Thesecondimposespositionalrequiremen

8、tssothattasksthatrequireprocessingfromthefronts

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。