A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
From MaRDI portal
Publication:3569942
DOI10.1007/978-3-642-13520-0_34zbMath1285.90045OpenAlexW1534526047MaRDI QIDQ3569942
Stefan Heinz, Timo Berthold, Jens Schulz, Marco E. Lübbecke, Rolf H. Möhring
Publication date: 22 June 2010
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15701
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Constraint programming and operations research, Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining, An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem, Using dual presolving reductions to reformulate cumulative constraints, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling, The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
Uses Software
