Optimizing the strategic patient mix combining queueing theory and dynamic programming

DOI10.1016/j.cor.2013.09.020zbMath1348.90208DBLPjournals/cor/VanberkelBHH14OpenAlexW2165843305WikidataQ59376072 ScholiaQ59376072MaRDI QIDQ336926

Johann L. Hurink, Erwin W. Hans, Peter T. Vanberkel, Richard J. Boucherie

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.020

zbMATH Keywords

dynamic programmingcombinatorial optimizationqueueing theorydiagnosis related groupsproject sequencing problem

Mathematics Subject Classification ID

Integer programming (90C10) Queues and service in operations research (90B22) Dynamic programming (90C39)

Related Items (4)

A multi-criteria approach for hospital capacity analysis ⋮ Scheduling operating rooms: achievements, challenges and pitfalls ⋮ Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities ⋮ A derivative-free approach for a simulation-based optimization problem in healthcare

Cites Work

• Unnamed Item
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• The \(k\)-partitioning problem
• Networks of infinite-server queues with nonstationary Poisson input
• Complexity of the Project Sequencing Problem
• The Discrete-Time Sequencing Expansion Problem
• Sequencing Capacity Expansion Projects in Continuous Time
• Operations Research and Capacity Expansion Problems: A Survey
• Technical Note—Multidimensional Sequencing Rule

This page was built for publication: Optimizing the strategic patient mix combining queueing theory and dynamic programming