两级供应链系统的调度与路由集成

Jen-Shiang Chen, Jin-shan Yang, Chia-Lin Lu
{"title":"两级供应链系统的调度与路由集成","authors":"Jen-Shiang Chen, Jin-shan Yang, Chia-Lin Lu","doi":"10.1109/ICSSSM.2009.5175017","DOIUrl":null,"url":null,"abstract":"Coordinating activities among supply, production, and delivery is an important issue for production and logistics management. In this study, a single machine scheduling model is developed that incorporated order release and delivery vehicle routing decisions which serves a single customer location. The objective is to minimize the makespan. The problem is NP-hard in the strong sense in general. Two integer programming models are developed to optimally solve this problem. Also, two efficient heuristics are proposed for solving large-sized problems. Computational results of the illustrative example are reported using the two integer programming models and two heuristics to solve the proposed problem.","PeriodicalId":287881,"journal":{"name":"2009 6th International Conference on Service Systems and Service Management","volume":"54 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Integration of scheduling and routing for two-echelon supply chain system\",\"authors\":\"Jen-Shiang Chen, Jin-shan Yang, Chia-Lin Lu\",\"doi\":\"10.1109/ICSSSM.2009.5175017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coordinating activities among supply, production, and delivery is an important issue for production and logistics management. In this study, a single machine scheduling model is developed that incorporated order release and delivery vehicle routing decisions which serves a single customer location. The objective is to minimize the makespan. The problem is NP-hard in the strong sense in general. Two integer programming models are developed to optimally solve this problem. Also, two efficient heuristics are proposed for solving large-sized problems. Computational results of the illustrative example are reported using the two integer programming models and two heuristics to solve the proposed problem.\",\"PeriodicalId\":287881,\"journal\":{\"name\":\"2009 6th International Conference on Service Systems and Service Management\",\"volume\":\"54 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 6th International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2009.5175017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2009.5175017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

协调供应、生产和交付之间的活动是生产和物流管理的一个重要问题。在本研究中,建立了一个包含订单释放和配送车辆路线决策的单台机器调度模型,该模型服务于单个客户位置。目标是最小化完工时间。一般来说,这个问题是np困难的。为了最优地解决这一问题,建立了两个整数规划模型。同时,提出了两种求解大规模问题的有效启发式算法。给出了用两种整数规划模型和两种启发式方法求解该问题的算例计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integration of scheduling and routing for two-echelon supply chain system
Coordinating activities among supply, production, and delivery is an important issue for production and logistics management. In this study, a single machine scheduling model is developed that incorporated order release and delivery vehicle routing decisions which serves a single customer location. The objective is to minimize the makespan. The problem is NP-hard in the strong sense in general. Two integer programming models are developed to optimally solve this problem. Also, two efficient heuristics are proposed for solving large-sized problems. Computational results of the illustrative example are reported using the two integer programming models and two heuristics to solve the proposed problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信