
Performance Analysis of Metaheuristic Algorithms for a Quadratic Assignment Problem
A quadratic assignment problem (QAP) is a combinatorial optimization pro...
read it

Roster Evaluation Based on Classifiers for the Nurse Rostering Problem
The personnel scheduling problem is a wellknown NPhard combinatorial p...
read it

HumanMachine Collaborative Optimization via Apprenticeship Scheduling
Coordinating agents to complete a set of tasks with intercoupled tempora...
read it

Swarm Intelligent Algorithm For Reentrant Hybrid Flow shop Scheduling Problems
In order to solve Reentrant Hybrid Flowshop (RHFS) scheduling problems ...
read it

Intelligent Solution System towards Parts Logistics Optimization
Due to the complication of the presented problem, intelligent algorithms...
read it

AirCROP: Airline Crew Pairing Optimizer for Complex Flight Networks Involving Multiple Crew Bases BillionPlus Variables
Airline scheduling poses some of the most challenging problems in the en...
read it

A Comparison of Random Task Graph Generation Methods for Scheduling Problems
How to generate instances with relevant properties and without bias rema...
read it
Intelligent Search Heuristics for Cost Based Scheduling
Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research in the literature solving the problem using metaheuristics 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
Comments
There are no comments yet.