Complexity of the scheduling language RSV

DOI10.1007/BF02831932zbMath1085.68064OpenAlexW2029410822MaRDI QIDQ815986

Pok-Son Kim, Arne Kutzner, Taehoon Park

Publication date: 20 February 2006

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02831932

zbMATH Keywords

NP-completenessdescription logicresource-constrained project scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• A comparative study of computational procedures for the resource constrained project scheduling problem
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Heuristics for resource-constrained scheduling†
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Complexity of Scheduling under Precedence Constraints
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

This page was built for publication: Complexity of the scheduling language RSV