{"title":"具有作业交付协调的双机流水车间调度","authors":"Jen-Shiang Chen","doi":"10.2174/1874243201105010039","DOIUrl":null,"url":null,"abstract":"This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept of assignment problem to formulate the proposed problems, while Model 2 bases on the dichotomous constraints models. Model 2 is theoretically better than Model 1 in size complexity analysis.","PeriodicalId":337071,"journal":{"name":"The Open Operational Research Journal","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Two-Machine Flow-Shop Scheduling with Job Delivery Coordination\",\"authors\":\"Jen-Shiang Chen\",\"doi\":\"10.2174/1874243201105010039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept of assignment problem to formulate the proposed problems, while Model 2 bases on the dichotomous constraints models. Model 2 is theoretically better than Model 1 in size complexity analysis.\",\"PeriodicalId\":337071,\"journal\":{\"name\":\"The Open Operational Research Journal\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Open Operational Research Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2174/1874243201105010039\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Open Operational Research Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2174/1874243201105010039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Two-Machine Flow-Shop Scheduling with Job Delivery Coordination
This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept of assignment problem to formulate the proposed problems, while Model 2 bases on the dichotomous constraints models. Model 2 is theoretically better than Model 1 in size complexity analysis.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
