Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the computational burden of techniques for reasoning about more complex types of temporal and resource capacity constraints places fairly restrictive limits on the size of problems that can be effectively addressed. In this paper, we focus on developing a scalable heuristic procedure to an extended, multi-capacity resource version of the job shop scheduling problem (MCJSSP). Our starting point is a previously developed procedure for generating feasible solutions to more complex, multi-capacity scheduling problems with maximum time lags. Adapting this procedure to exploit the simpler temporal structure of MCJSSP, we are able to produce a quite efficient solution generator. However, the procedure only indirectly attends to MCJSSP's objective criterion and produces sub-optimal solutions. To provide a scalable, opti...

• Type: Conference
• Year: 2000
• Where: AAAI
• Authors: Amedeo Cesta, Angelo Oddi, Stephen F. Smith
• Keywords: AAAI 2000, Intelligent Agents, Iterative Flattening, Iterative Flattening Procedure, Procedure