A Meta-RaPS algorithm for spatial scheduling with release times
by Christopher Garcia; Ghaith Rabadi
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 1/2, 2011

Abstract: Spatial scheduling involves jobs that require processing space as well as time. Space is a limited resource, and solutions require assigning a location to each job within the available processing space in addition to a start time. We consider problems where each job has a release time and multiple processing areas are used in parallel. We develop an algorithm for minimising total tardiness based on Meta-heuristic for Randomised Priority Search (Meta-RaPS), a meta-heuristic that has been very effective on many scheduling and combinatorial optimisation problems. Our algorithm performs effectively on a large variety of benchmark problems.

Online publication date: Sat, 31-Dec-2011

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 Planning and Scheduling (IJPS):
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