An integrated MILP for music rehearsal problems with waiting time

Chakrit Pakprajum, P. Jarumaneeroj
{"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}
引用次数: 0

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.
一种针对等待时间的音乐排练问题的集成MILP
音乐排练对于任何音乐会和管弦乐演出都是至关重要的,因为它可以帮助相关的演奏者为生活做好准备。经常排练为佳;但是,由于巨大的运营成本,包括主要的租金和工资成本,在现实生活中并不那么实用。排练组成部分的数量,即音乐作品和音乐家的数量,也会影响排练计划,因为它使这些重点元素在多个排练天中的分配和顺序变得复杂。不恰当的计划也可能使没有参与的演奏者在排练场地无所事事。虽然这个所谓的音乐排练问题通常是通过两阶段启发式来解决的,但本文旨在开发一个集成的MILP,在一个阶段内解决这样的问题。该模型将有能力车辆路线问题与传统音乐排演问题相结合。我们用以前研究中的16个基准实例来测试我们的模型。在总计算时间内,成功地找到并报告了这些实例的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书