企业生产与物流管理作业答案v.docxVIP

下载本文档

30
0
约6.13千字
约 9页
2017-06-19 发布于湖南
举报
版权申诉

企业生产与物流管理作业答案v.docx

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

企业生产与物流管理作业（答案）Given the following product structure, master production schedule, and inventory status and assuming the requirements for each BOM item is 1. Complete a material requirements planning for item G using lot-for-lot rule (i.e. identify the planned order release for item G). Perioross requirements: ross requirements: H10050ItemOn handLead TimeItemOn handLead TimeA01F752B1002G751C502H01D501J1002E752Answer:A123456789101112Gross requiremenn-hand 0Net requiremenlanned order receiplanned order releas123456789101112Gross requirement10050On-hand 0Net requirement10050Planned order receipt10050Planned order release10050C123456789101112Requirement from equirement from H10050On-hand 50505050505050-50Net requirement501005050150Planned order receipt501005050150Planned order release501005050150G123456789101112Requirement from C501005050150On-hand 757575757525-75Net requirement755050150Planned order receipt755050150Planned order release755050150Solve the following instance of the job shop problem with no recirculation and the makespan as objective using shifting bottleneck heuristic.Jobs m/c sequenceProcessing time11,2,3p11=9; p21=8; p31=421,2,4p12=5; p22=6; p42=333,1,2p33=10; p13=4; p23=9Iteration 1：Set up a nonpreemptive single machine maximum latenessproblem for Machine 1:Jobs123p1j954r1j0010d1j111414Optimum sequence is 1,2,3 with Lmax(1)=4Set up a nonpreemptive single machine maximum latenessproblem for Machine 1:Jobs123p2j869r2j9514d2j192023Optimum sequence is 2,1,3 with Lmax(2)=5Similarly, Lmax(3)=0 Lmax(4)=0Machine 2 is the bottleneckIteration 2：Set up a nonpreemptive single machine maximum latenessproblem for Machine 1:Jobs123p1j954r1j0010d1j11519Optimum sequence is 2,1,3 with Lmax(1)=3Similarly, Lmax(3)=0 Lmax(4)=0Machine 1 is the bottleneckIteration 3：M0={2,1} Cmax=28+3=31Similarly, Lmax(3)=0 Lmax(4)=0The Final Schedule is:Cmax=31A local firm manufactures children’s toys. The pro