Integer and combinatorial optimization
Integer and combinatorial optimization
Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Artificial Intelligence - Special issue on knowledge representation
The OPL optimization programming language
The OPL optimization programming language
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Scheduling Algorithms
Constraint-Based Scheduling
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Programming Contribution to Benders Decomposition: A Case Study
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Logic, Optimization, and Constraint Programming
INFORMS Journal on Computing
Scheduling and constraint propagation
Discrete Applied Mathematics
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Mixed discrete and continuous algorithms for scheduling airborne astronomy observations
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Planning for mixed discrete continuous domains
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An efficient hybrid strategy for temporal planning
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A knowledge-based evolutionary assistant to software development project scheduling
Expert Systems with Applications: An International Journal
New model and heuristics for safety stock placement in general acyclic supply chain networks
Computers and Operations Research
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
An improved MIP-based approach for a multi-skill workforce scheduling problem
Journal of Scheduling
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We study an assignment type resource-con- strained project scheduling problem with resources being multi-skilled personnel to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective cut-generating scheme based on temporal analysis in project scheduling is devised for resolving resource conflicts. The computational study shows that our hybrid MILP/CP algorithm is both effective and efficient compared to the pure MILP or CP method alone.