Author： Garcia Christopher
Publisher： Inderscience Publishers
ISSN： 2044-494X
Source： International Journal of Planning and Scheduling, Vol.1, Iss.1-2, 2011-12, pp. : 19-31
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
A fast algorithm for time compression in project scheduling
Operational Research, Vol. 2, Iss. 3, 2002-09 ,pp. :
Access to resources
Recommend
A greedy algorithm for scheduling tasks on production lines
Operational Research, Vol. 1, Iss. 3, 2001-09 ,pp. :