Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method

DOI10.1007/978-3-540-72397-4_10MaRDI QIDQ3612413zbMATH OpenOpenAlexFDO

Authors András Kéri, Tamás Kis

Publication date 10 March 2009

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://doi.org/10.1007/978-3-540-72397-4_10

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4135692
• scientific article; zbMATH DE number 2013754
• Resource-constrained project scheduling with time windows
• Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
• A constraint-based method for project scheduling with time windows

This page was built for publication: Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method

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