{"title":"Production transportation scheduling for process industry","authors":"Xiaoqiang Zhao, Y. Wan","doi":"10.1109/CINC.2010.5643749","DOIUrl":null,"url":null,"abstract":"Production transportation scheduling problem with constraints is common in process industry. But it is a NP-hard problem. In this paper, the production transportation scheduling problem between a plant that produces intermediate products and a finishing plant which processes the intermediate products in finished goods is studied. Model formulation and solution method are proposed. Using simulated data from a process industry firm, the computational study shows that schedules yield significant cost.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2010.5643749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Production transportation scheduling problem with constraints is common in process industry. But it is a NP-hard problem. In this paper, the production transportation scheduling problem between a plant that produces intermediate products and a finishing plant which processes the intermediate products in finished goods is studied. Model formulation and solution method are proposed. Using simulated data from a process industry firm, the computational study shows that schedules yield significant cost.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
