A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems (Q1096529)

The problem of planning, scheduling, and controlling manufacturing operations over time where constraints on available resources exist (e.g. workstations, labor, facilities, materials and equipment) is a difficult mathematical programming problem. The Resource Constrained Scheduling Problem (RCSP) as it is often referred to, is known to be NP-complete which necessitates the creation of heuristics. In this paper, a multi- level, multi-priority schema is presented which enables the user to deal with static environments but places special emphasis on quasi-dynamic scheduling environments. The polynomial time and space complexity of the heuristic together with the computational experience demonstrate the effectiveness of the quasi-dynamic heuristic.