Complexity of the scheduling language RSV

DOI10.1007/BF02831932MaRDI QIDQ815986zbMATH OpenOpenAlexFDO

Authors Pok-Son Kim, Arne Kutzner, Tae Hoon 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

description logicNP-completenessresource-constrained project scheduling problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1808299
• scientific article; zbMATH DE number 1264426
• A survey of variants and extensions of the resource-constrained project scheduling problem
• scientific article; zbMATH DE number 3891075
• Scheduling and constraint propagation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 805390 (Why is no real title available?)
• scientific article; zbMATH DE number 4197725 (Why is no real title available?)
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A comparative study of computational procedures for the resource constrained project scheduling problem
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Complexity of Scheduling under Precedence Constraints
• Heuristics for resource-constrained scheduling†
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• Some efficient multi-heuristic procedures for resource-constrained project scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815986)