近似多级瓶颈分配问题

Scheduling eJournal Pub Date : 2012-02-09 DOI:10.2139/ssrn.2001994

Trivikram Dokka, Anastasia Kouvela, F. Spieksma

{"title":"近似多级瓶颈分配问题","authors":"Trivikram Dokka, Anastasia Kouvela, F. Spieksma","doi":"10.2139/ssrn.2001994","DOIUrl":null,"url":null,"abstract":"We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book \"Assignment Problems\" by Burkard et al. (2009) on pages 188 - 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"274 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Approximating the Multi-Level Bottleneck Assignment Problem\",\"authors\":\"Trivikram Dokka, Anastasia Kouvela, F. Spieksma\",\"doi\":\"10.2139/ssrn.2001994\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book \\\"Assignment Problems\\\" by Burkard et al. (2009) on pages 188 - 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.\",\"PeriodicalId\":374055,\"journal\":{\"name\":\"Scheduling eJournal\",\"volume\":\"274 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-02-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scheduling eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.2001994\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scheduling eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2001994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

本文研究了多层次瓶颈分配问题(MBA)。这个问题在Burkard et al.(2009)的新书《Assignment Problems》(第188 - 189页)中有描述。其中描述的一个应用程序涉及总线驾驶员调度。我们把这个问题看作是瓶颈m维多索引分配问题的一个特例。我们给出了近似算法和不近似结果，这取决于底层图的完备性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximating the Multi-Level Bottleneck Assignment Problem

We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book "Assignment Problems" by Burkard et al. (2009) on pages 188 - 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Scheduling eJournal

自引率

0.00%

发文量