{"title":"一种针对等待时间的音乐排练问题的集成MILP","authors":"Chakrit Pakprajum, P. Jarumaneeroj","doi":"10.1109/IEA.2017.7939209","DOIUrl":null,"url":null,"abstract":"Music rehearsal is crucial for any concerts and orchestral performances as it helps those related players ready for the lives. Frequent rehearsing is preferable; but, not that practical in real life due to immense operational costs, including major costs of rental and wages. The number of rehearsal components, i.e. music pieces and musicians, also affects the rehearsal planning as it complicates the assigning and sequencing of those underlining elements in multiple rehearsal days. Improper planning may also leave uninvolved players stay idle in the rehearsal place. While this so-called music rehearsal problem is typically solved by two-stage heuristics, this paper aims to develop an integrated MILP that solves such a problem to optimality in one stage. This model is a combination of the capacitated vehicle routing problem and traditional music rehearsal problem. We test our model with 16 benchmark instances from previous studies. The optimal solutions to those instances are successfully found and reported with total computational time.","PeriodicalId":239397,"journal":{"name":"2017 4th International Conference on Industrial Engineering and Applications (ICIEA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An integrated MILP for music rehearsal problems with waiting time\",\"authors\":\"Chakrit Pakprajum, P. Jarumaneeroj\",\"doi\":\"10.1109/IEA.2017.7939209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Music rehearsal is crucial for any concerts and orchestral performances as it helps those related players ready for the lives. Frequent rehearsing is preferable; but, not that practical in real life due to immense operational costs, including major costs of rental and wages. The number of rehearsal components, i.e. music pieces and musicians, also affects the rehearsal planning as it complicates the assigning and sequencing of those underlining elements in multiple rehearsal days. Improper planning may also leave uninvolved players stay idle in the rehearsal place. While this so-called music rehearsal problem is typically solved by two-stage heuristics, this paper aims to develop an integrated MILP that solves such a problem to optimality in one stage. This model is a combination of the capacitated vehicle routing problem and traditional music rehearsal problem. We test our model with 16 benchmark instances from previous studies. The optimal solutions to those instances are successfully found and reported with total computational time.\",\"PeriodicalId\":239397,\"journal\":{\"name\":\"2017 4th International Conference on Industrial Engineering and Applications (ICIEA)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 4th International Conference on Industrial Engineering and Applications (ICIEA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEA.2017.7939209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Industrial Engineering and Applications (ICIEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEA.2017.7939209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An integrated MILP for music rehearsal problems with waiting time
Music rehearsal is crucial for any concerts and orchestral performances as it helps those related players ready for the lives. Frequent rehearsing is preferable; but, not that practical in real life due to immense operational costs, including major costs of rental and wages. The number of rehearsal components, i.e. music pieces and musicians, also affects the rehearsal planning as it complicates the assigning and sequencing of those underlining elements in multiple rehearsal days. Improper planning may also leave uninvolved players stay idle in the rehearsal place. While this so-called music rehearsal problem is typically solved by two-stage heuristics, this paper aims to develop an integrated MILP that solves such a problem to optimality in one stage. This model is a combination of the capacitated vehicle routing problem and traditional music rehearsal problem. We test our model with 16 benchmark instances from previous studies. The optimal solutions to those instances are successfully found and reported with total computational time.