Abdelhak Elidrissi, R. Benmansour, M. Benbrahim, D. Duvivier
{"title":"具有单服务器的同一并行机器调度问题的MIP公式","authors":"Abdelhak Elidrissi, R. Benmansour, M. Benbrahim, D. Duvivier","doi":"10.1109/ICOA.2018.8370596","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of scheduling a set of independent jobs on an arbitrary number of identical parallel machines with setup consideration and a makespan objective. The setup operations are performed by one available server. We propose two mixed integer programming (MIP) formulations to solve optimally this problem. The performance of each model is compared with another MIP proposed in the literature. It turns out that our formulation based on time-indexed variables outperforms the other models.","PeriodicalId":433166,"journal":{"name":"2018 4th International Conference on Optimization and Applications (ICOA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"MIP formulations for identical parallel machine scheduling problem with single server\",\"authors\":\"Abdelhak Elidrissi, R. Benmansour, M. Benbrahim, D. Duvivier\",\"doi\":\"10.1109/ICOA.2018.8370596\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of scheduling a set of independent jobs on an arbitrary number of identical parallel machines with setup consideration and a makespan objective. The setup operations are performed by one available server. We propose two mixed integer programming (MIP) formulations to solve optimally this problem. The performance of each model is compared with another MIP proposed in the literature. It turns out that our formulation based on time-indexed variables outperforms the other models.\",\"PeriodicalId\":433166,\"journal\":{\"name\":\"2018 4th International Conference on Optimization and Applications (ICOA)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 4th International Conference on Optimization and Applications (ICOA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOA.2018.8370596\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Optimization and Applications (ICOA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOA.2018.8370596","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MIP formulations for identical parallel machine scheduling problem with single server
This paper considers the problem of scheduling a set of independent jobs on an arbitrary number of identical parallel machines with setup consideration and a makespan objective. The setup operations are performed by one available server. We propose two mixed integer programming (MIP) formulations to solve optimally this problem. The performance of each model is compared with another MIP proposed in the literature. It turns out that our formulation based on time-indexed variables outperforms the other models.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
