ABA: an assignment based algorithm for resource allocation

In this paper we describe an approach to allocating a set of tasks to a set of resources or processors. The novelty of the approach has to do with the way decisions are performed. Rather than making one decision about one resource (or one task) at a time, several decisions concerning multiple resources and multiple tasks are made at a time. The algorithm incorporates the formulation of the assignment problem. Furthermore, knowledge about temporal constraints between activities is exploited to improve the computational efficiency of the algorithm. The algorithm is very flexible, allowing for the incorporation of different types of constraints as well as the consideration of non-equivalent resources.

[1]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[2]  Norman Sadeh,et al.  Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .

[3]  Kenneth Alan Pasch,et al.  Heuristics for job-shop scheduling , 1988 .

[4]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[5]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[6]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[7]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[8]  Subhash C. Narula,et al.  Multi-Project Scheduling: Analysis of Project Performance , 1985 .

[9]  Carla Octávia da Silva Pedro Gomes.  Escalonamento de tripulações : geração de cadeias de voo para uma frota de médio curso , 1987 .

[10]  Nicola Muscettola,et al.  Scheduling by iterative partition of bottleneck conflicts , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[11]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[12]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[13]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[14]  Claude Le Pape,et al.  SONIA: A knowledge-based scheduling system , 1988, Artif. Intell. Eng..

[15]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[16]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[17]  Stephen F. Smith,et al.  Constructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems , 1986, AI Mag..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[20]  Carla Pedro Gomes.  Achieving global coherence by exploiting conflict : a distributed framework for job shop scheduling , 1992 .

[21]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .