Two level heuristic for the resource constrained scheduling problem

DOI10.1080/00207548608919797zbMath0596.90046OpenAlexW2031430327MaRDI QIDQ3730330

Mario I. Norbis, James MacGregor Smith

Publication date: 1986

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548608919797

zbMATH Keywords

polynomial timespace complexityresource constrained scheduling problemtwo level heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems ⋮ A constraint-based perspective in resource constrained project scheduling ⋮ An experimental analysis of solution performance in a resource sharing and scheduling problem ⋮ An interactive decision support system for the resource constrained scheduling problem ⋮ Heuristic methods and applications: A categorized survey ⋮ A comparative study of computational procedures for the resource constrained project scheduling problem

Cites Work

• New directions in scheduling theory
• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
• Multi-Project Scheduling: Categorization of Heuristic Rules Performance
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Complexity of Scheduling under Precedence Constraints
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• A Simulation Study of Predictable Due-Dates
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints

This page was built for publication: Two level heuristic for the resource constrained scheduling problem