已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price

计算机科学 数学优化 调度(生产过程) 算法 数学
作者
Antoine Legrain,Jérémy Omer
出处
期刊:Informs Journal on Computing 卷期号:36 (4): 1108-1128 被引量:2
标识
DOI:10.1287/ijoc.2023.0019
摘要

In this paper, we describe a branch-and-price algorithm for the personalized nurse scheduling problem. The variants that appear in the literature involve a large number of constraints that can be hard or soft, meaning that they can be violated at the price of a penalty. We capture the diversity of the constraints on individual schedules by seven generic constraints characterized by lower and upper bounds on a given quantity. The core of the column generation procedure is in the identification of individual schedules with minimum reduced cost. For this, we solve a shortest path problem with resource constraints (SPPRC) where several generic constraints are modeled as resource constraints. We then describe dominance rules adapted to the presence of both upper and lower bounds on the resources and leverage soft constraints to improve the dominance. We also describe several acceleration techniques for the solution of the SPPRC, and branching rules that fit the specificities of the problem. Our numerical experiments are based on the instances of three benchmarks of the literature including those of the two international nurse rostering competitions (INRC-I and INRC-II). Their objective is threefold: assess the dominance rules and the acceleration techniques, investigate the capacity of the algorithm to find provable optimal solutions of instances that are still open, and conduct a comparison with best published results. The most noticeable conclusion is that the improved solution of the SPPRC allows to solve optimally all the INRC-II instances where a four-week planning horizon is considered and 40% of the eight-week instances. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2023.0019 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
好呀好呀发布了新的文献求助10
2秒前
小枣完成签到 ,获得积分10
4秒前
Eunice完成签到,获得积分10
6秒前
CC发布了新的文献求助10
6秒前
gjx完成签到 ,获得积分10
8秒前
CJY完成签到 ,获得积分10
8秒前
WilliamJarvis完成签到 ,获得积分10
9秒前
大胆灵竹发布了新的文献求助10
10秒前
明亮的遥完成签到 ,获得积分0
12秒前
12秒前
up完成签到 ,获得积分10
12秒前
wanci应助深情夏彤采纳,获得10
13秒前
程艳完成签到 ,获得积分10
13秒前
科研通AI5应助zm_qian采纳,获得10
14秒前
16秒前
Wang_JN完成签到 ,获得积分10
16秒前
ASXC完成签到,获得积分20
16秒前
皮卡丘发布了新的文献求助10
17秒前
哔噗哔噗完成签到 ,获得积分10
18秒前
乐乐乐乐乐乐应助momo采纳,获得10
20秒前
ASXC发布了新的文献求助10
20秒前
21秒前
LIU完成签到 ,获得积分10
21秒前
成就书雪完成签到 ,获得积分10
21秒前
duohao2023发布了新的文献求助30
21秒前
mjsdx完成签到,获得积分10
22秒前
26秒前
pengtao919发布了新的文献求助10
26秒前
科目三应助大胆灵竹采纳,获得10
28秒前
zozox完成签到 ,获得积分10
29秒前
友好旭尧发布了新的文献求助10
30秒前
林夕完成签到 ,获得积分10
32秒前
mjsdx发布了新的文献求助10
33秒前
七月完成签到,获得积分10
35秒前
光能使者完成签到,获得积分10
37秒前
43秒前
友好旭尧完成签到,获得积分10
46秒前
46秒前
小谢同学完成签到 ,获得积分10
47秒前
SYLH应助ASXC采纳,获得20
47秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 350
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
Aktuelle Entwicklungen in der linguistischen Forschung 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3989957
求助须知:如何正确求助?哪些是违规求助? 3532034
关于积分的说明 11256000
捐赠科研通 3270880
什么是DOI,文献DOI怎么找? 1805070
邀请新用户注册赠送积分活动 882252
科研通“疑难数据库(出版商)”最低求助积分说明 809216