No Detail Found!

A Multilayered Heuristic for Solving Curricula Scheduling Problems

Author(s)
Aftab Ahmed Department of Computer Science,University of Information Technology, Engineering and Management Sciences, Quetta, Pakistan
Muhammad Atif Faculy of Life Sciences, Balochistan University of Information Technology, Engineering and Management Sciences,Quetta,Pakistan
Jamil Ahmad Faculy of Life Sciences, Balochistan University of Information Technology, Engineering and Management Sciences,Quetta,Pakistan
Abstract
Curricula Scheduling problem is recognized essentially on account of its vital significance in academia. The problem  is  echoed  as tough  resources placement job against troublesome constraints. The problem has been investigated by research community for several decades because of its inevitable importance and association with Non-deterministic Polynomialtime hard (NP-Hard) complexity. This research article investigates a novel and contemporary approach of using Memetic Algorithms (MA) centered Hyper Heuristic model to scrutinize the performance. The dynamic parameters of higher heuristic are get  corrected and improvised with each iteration on the basis of performance measure. The signs learned from the experiments conclude the study-work steps forward in scheduling research and the scope of prospective and  significant research direction are noticeable and remain open in the future. The work concluded with implementation of prototype coded in python language.
Publication Details
Page(s) 7-11
DOI DOI not available
Published Journal: Journal of Applied and Emerging Sciences , Volume: 5, Issue: 1, Year: 2014

Request the full text from PASTIC

Keywords
constraints, Heuristic, Curricula Scheduling
0

Citations

0

Downloads

84

Views