Learning-based approach for multiprocessor scheduling under timing constraints and N-Queens problems
by Yacine Laalaoui, Habiba Drias
International Journal of Advanced Operations Management (IJAOM), Vol. 1, No. 4, 2009

Abstract: This paper presents a learning-based algorithm to address the deadline scheduling problem. This problem consists of searching for feasible schedules of n tasks on m identical processors under hard-real-time constraints. Unlike existing works, the proposed algorithm is time limited rather than time and space limited since the problem under study is NP-hard. Two learning functions are integrated to direct the search toward possible feasible schedules. Experimental results show a significant success ratio improvement of the proposed scheduling algorithm compared to plain heuristics and metaheuristics namely ACO. We propose a new look for N-Queens problem as deadline scheduling and we show how our algorithm can deal with the N-Queens problem and its possible applicability to cope with CSP problems.

Online publication date: Wed, 27-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com