简单、快速、有效的护士名册两阶段法

Q3 Business, Management and Accounting

American Journal of Mathematical and Management Sciences Pub Date : 2020-01-02 DOI:10.1080/01966324.2019.1570882

F. Guessoum, S. Haddadi, E. Gattal

{"title":"简单、快速、有效的护士名册两阶段法","authors":"F. Guessoum, S. Haddadi, E. Gattal","doi":"10.1080/01966324.2019.1570882","DOIUrl":null,"url":null,"abstract":"SYNOPTIC ABSTRACT The nurse rostering problem is to create a day-to-day shift assignment of each nurse subject to a predefined set of constraints. Based on simple ideas, a two-phase method is suggested. The first phase consists of applying a generic variable-fixing heuristic. As a result, a very small and sparse-reduced problem is obtained. In the second phase, the reduced problem is solved by utilizing a general-purpose MIP solver. The proposed method is tested on NSPLib dataset, and the results obtained show that it is capable of identifying high quality solutions. When compared with recently developed methods, it turns out to be the fastest.","PeriodicalId":35850,"journal":{"name":"American Journal of Mathematical and Management Sciences","volume":"39 1","pages":"1 - 19"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/01966324.2019.1570882","citationCount":"7","resultStr":"{\"title\":\"Simple, Yet Fast and Effective Two-Phase Method for Nurse Rostering\",\"authors\":\"F. Guessoum, S. Haddadi, E. Gattal\",\"doi\":\"10.1080/01966324.2019.1570882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SYNOPTIC ABSTRACT The nurse rostering problem is to create a day-to-day shift assignment of each nurse subject to a predefined set of constraints. Based on simple ideas, a two-phase method is suggested. The first phase consists of applying a generic variable-fixing heuristic. As a result, a very small and sparse-reduced problem is obtained. In the second phase, the reduced problem is solved by utilizing a general-purpose MIP solver. The proposed method is tested on NSPLib dataset, and the results obtained show that it is capable of identifying high quality solutions. When compared with recently developed methods, it turns out to be the fastest.\",\"PeriodicalId\":35850,\"journal\":{\"name\":\"American Journal of Mathematical and Management Sciences\",\"volume\":\"39 1\",\"pages\":\"1 - 19\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/01966324.2019.1570882\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American Journal of Mathematical and Management Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/01966324.2019.1570882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Business, Management and Accounting\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Journal of Mathematical and Management Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01966324.2019.1570882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}

引用次数: 7

摘要

概要摘要护士名册问题是为每个护士创建一个受预定义约束集约束的日常轮班分配。基于简单的思想，提出了两阶段法。第一阶段包括应用通用的变量修复启发式。结果，得到了一个非常小的稀疏化问题。在第二阶段，利用通用的MIP求解器来解决简化后的问题。在NSPLib数据集上进行了测试，结果表明该方法能够识别出高质量的解。与最近开发的方法相比，它是最快的。

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

查看原文本刊更多论文

Simple, Yet Fast and Effective Two-Phase Method for Nurse Rostering

SYNOPTIC ABSTRACT The nurse rostering problem is to create a day-to-day shift assignment of each nurse subject to a predefined set of constraints. Based on simple ideas, a two-phase method is suggested. The first phase consists of applying a generic variable-fixing heuristic. As a result, a very small and sparse-reduced problem is obtained. In the second phase, the reduced problem is solved by utilizing a general-purpose MIP solver. The proposed method is tested on NSPLib dataset, and the results obtained show that it is capable of identifying high quality solutions. When compared with recently developed methods, it turns out to be the fastest.

求助全文

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

来源期刊

American Journal of Mathematical and Management Sciences Business, Management and Accounting-Business, Management and Accounting (all)

CiteScore

2.70

自引率

0.00%

发文量