Intelligent Search Heuristics for Cost Based Scheduling

10/04/2012
by   Murphy Choy, et al.
0

Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research in the literature solving the problem using meta-heuristics approaches. In this paper, we will investigate an intelligent search heuristics that handles cost based scheduling problem. The heuristics demonstrated superior performances compared to the original algorithms used to solve the problems described in Li et. Al. (2003) and Ozkarahan (1989) in terms of time needed to establish a feasible solution. Both problems can be formulated as a cost problem. The search heuristic consists of several phrases of search and input based on the cost of each assignment and how the assignment will interact with the cost of the resources.

READ FULL TEXT

page 8

page 9

research
07/29/2020

Performance Analysis of Meta-heuristic Algorithms for a Quadratic Assignment Problem

A quadratic assignment problem (QAP) is a combinatorial optimization pro...
research
11/15/2021

Learning Robust Scheduling with Search and Attention

Allocating physical layer resources to users based on channel quality, b...
research
05/11/2018

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

Coordinating agents to complete a set of tasks with intercoupled tempora...
research
07/01/2021

Towards Utilitarian Combinatorial Assignment with Deep Neural Networks and Heuristic Algorithms

This paper presents preliminary work on using deep neural networks to gu...
research
12/09/2018

Swarm Intelligent Algorithm For Re-entrant Hybrid Flow shop Scheduling Problems

In order to solve Re-entrant Hybrid Flowshop (RHFS) scheduling problems ...
research
03/09/2020

AirCROP: Airline Crew Pairing Optimizer for Complex Flight Networks Involving Multiple Crew Bases Billion-Plus Variables

Airline scheduling poses some of the most challenging problems in the en...
research
04/13/2018

Roster Evaluation Based on Classifiers for the Nurse Rostering Problem

The personnel scheduling problem is a well-known NP-hard combinatorial p...

Please sign up or login with your details

Forgot password? Click here to reset