{"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}
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.