logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Mixed-integer linear programming and constraint programming formulations for solving the three-stage no-wait surgery scheduling problem

delete2026-03-16
delete0
PRE
AI
Y
Yaohui Guo
W
Wang, Yang Lin;Chen, Rouan;Su, Jenn Fang;Cheng, Liao-Ping
Z
Zequn Wei *
A
Abraham P. Punnen
DOI：10.1016/j.cie.2026.111976delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• The NP-hard three-stage no-wait surgery scheduling problem is studied. • Four MILP models and one CP model are developed. • CP outperforms MILP models in both deterministic and stochastic scenarios. • CP model remains competitive with two representative metaheuristics. • All benchmark instances are publicly available.
Keywords:
three-stage no-wait surgery scheduling
mixed-integer linear programming
constraint programming
NP-hard problem
benchmark instances

Journal

C
Computers & Industrial Engineering
IF:
6.5
Papers:
598
Citations:
0

Organization

N
northwestern polytechnical university
Scholars:
1.3W
Papers: 4.6K
Citations: 0
B
beijing university of posts and telecommunications
Scholars:
2.3K
Papers: 861
Citations: 0
S
simon fraser university
Scholars:
1.7K
Papers: 891
Citations: 0
researcher View more organizations
Cited Papers

Cited Papers

No cited papers available