Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem

Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem

Scheduling problem is ubiquitous in many industries. However, real industrial scheduling problem can sometimes become too complicated. Therefore, specific problems are formulated as instances that can be studied in detail; one of which is known as the Multi-mode Resource-Constrained Project Scheduli...

Full description

Saved in:
Bibliographic Details
Main Author: Marshal, Brian.
Other Authors: Low Yoke Hean, Malcolm
Format: Final Year Project
Language:English
Published: 2011
Subjects:
DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Online Access:http://hdl.handle.net/10356/44142
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:Scheduling problem is ubiquitous in many industries. However, real industrial scheduling problem can sometimes become too complicated. Therefore, specific problems are formulated as instances that can be studied in detail; one of which is known as the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). Solving MRCPSP itself is very challenging since, up to now, no polynomial approach is able to solve it optimally. In MRCPSP, a project has a list of non-preemptable activities; each of them is to be executed in one of the several modes representing a relation between resources requirement and execution duration. The schedule has to be precedence-feasible as well as resource-feasible.

Similar Items