Dynamic programming with approximation function for nurse scheduling

QR Code

Dynamic programming with approximation function for nurse scheduling

Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature have reported the application of dynamic programmin...

Full description

Bibliographic Details
Main Authors:	Shi, Peng, Landa-Silva, Dario
Format:	Article
Language:	English
Published:	Springer Verlag 2016
Subjects:	Markov Decision Process Approximate Dynamic Programming Nurse Scheduling Problem
Online Access:	https://eprints.nottingham.ac.uk/35585/

Similar Items

A heuristic algorithm based on multiassignment procedures for nurse scheduling
by: Constantino, Ademir Aparecido, et al.
Published: (2014)

A heuristic algorithm for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir A., et al.
Published: (2011)

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Lookahead policy and genetic algorithm for solving nurse rostering problems
by: Shi, Peng, et al.
Published: (2018)

A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir Aparecido, et al.
Published: (2015)

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems
by: Le, Khoi Nguyen
Published: (2011)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2017)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Building Better Nurse Scheduling Algorithms
by: Aickelin, Uwe, et al.
Published: (2004)

Multi depot dynamic vehicle routing problem with stochastic road capacity for emergency medical supply delivery in humanitarian logistics
by: Anuar, Wadi Khalid
Published: (2022)

An Estimation of Distribution Algorithm for Nurse Scheduling
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm for Nurse Scheduling
by: Aickelin, Uwe, et al.
Published: (2007)

Workforce scheduling and routing problems: literature survey and computational study
by: Castillo-Salazar, J. Arturo, et al.
Published: (2016)

Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem
by: Shi, Peng, et al.
Published: (2017)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

The Optimal Observability of Partially Observable Markov Decision Processes: Discrete State Space
by: Rezaeian, M., et al.
Published: (2010)

Computational study for workforce scheduling and routing problems
by: Castillo-Salazar, J. Arturo, et al.
Published: (2014)

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
by: Laesanklang, Wasakorn, et al.
Published: (2017)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

An Estimation of Distribution Algorithm for Nurse Scheduling
by: Aickelin, Uwe, et al.
Published: (2005)

Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem
by: Algethami, Haneen, et al.
Published: (2017)

A study of genetic operators for the Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2015)

Heuristic decomposition and mathematical programming for workforce scheduling and routing problems
by: Laesanklang, Wasakorn
Published: (2017)

Towards an integrated workforce management system
by: Landa-Silva, Dario, et al.
Published: (2010)

Results in stochastic control: optimal prediction problems and Markov decision processes
by: Pérez López, Iker
Published: (2015)

A survey of workforce scheduling and routing
by: Castillo-Salazar, Arturo, et al.
Published: (2012)

Successive Convex Approximations to Cardinality-Constrained Convex Programs: A Piecewise-Linear DC Approach
by: Zheng, X., et al.
Published: (2014)

An efficient sampling scheme for approximate processing of decision support queries
by: Rudra, Amit, et al.
Published: (2012)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

Transformer asset management based on Markov Prediction Model utilizing health index
by: Yahaya, Muhammad Sharil
Published: (2019)

Picking adequate samples for approximate decision support queries using inverse SRSWOR
by: Rudra, Amit, et al.
Published: (2012)

Markov decision process algorithms for wealth allocation problems with defaultable bonds
by: Pérez López, Iker, et al.
Published: (2016)

Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem
by: Algethami, Haneen, et al.
Published: (2017)

Match-up strategies and fuzzy robust scheduling for a complex dynamic real world job shop scheduling problem
by: Moratori, Patrick
Published: (2013)

Optimisation models and algorithms for workforce scheduling and routing
by: Castillo Salazar, José Arturo
Published: (2015)

Interpolation and Approximation of Non Differentiable Function Using Polynomial
by: Koo, Lee Feng
Published: (2007)