A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness
{"title":"A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness","authors":"Papimol Kongsri, J. Buddhakulsomsiri","doi":"10.1109/ICIEA49774.2020.9102086","DOIUrl":null,"url":null,"abstract":"This paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance, makespan, total tardiness, and a combination of both measures, are minimize. Results from a numerical example show that, with a proper weight between the two measures, a compromise solution can be found.","PeriodicalId":306461,"journal":{"name":"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA49774.2020.9102086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance, makespan, total tardiness, and a combination of both measures, are minimize. Results from a numerical example show that, with a proper weight between the two measures, a compromise solution can be found.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
