A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
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.
- Heuristic for a new multiobjective scheduling problem
- Heuristics for multimode scheduling problems with dedicated resources
- Two level heuristic for the resource constrained scheduling problem
- A dynamic approach to multiple-objective resource allocation problem
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- scientific article; zbMATH DE number 1808554
- Heuristics for scheduling in flowshop with multiple objectives
- Approximating multi-objective scheduling problems
- scientific article; zbMATH DE number 4143763
- A Review of Production Scheduling
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- New directions in scheduling theory
- On the interactive solution to a multicriteria scheduling problem
- Solving a bicriterion scheduling problem
- Two level heuristic for the resource constrained scheduling problem
- Multiple and bicriteria scheduling: A literature survey
- An interactive decision support system for the resource constrained scheduling problem
- Simulated annealing for resource-constrained scheduling
- Constrained multi-project planning problems: A Lagrangean decomposition approach
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Hierarchical models for multi-project planning and scheduling
- Heuristic for a new multiobjective scheduling problem
- Dynamic transport scheduling under multiple resource constraints
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
- Two level heuristic for the resource constrained scheduling problem
- A constraint-based perspective in resource constrained project scheduling
- scientific article; zbMATH DE number 1452997 (Why is no real title available?)
- An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness
This page was built for publication: A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096529)
