Reducing the feasible solution space of resource-constrained project instances

Vanhoucke, Mario; Coelho, José

http://hdl.handle.net/10400.2/16685

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Vanhoucke e Coelho - 2024 - Reducing the feasible solution space of resource-c.pdf		1.61 MB	Adobe PDF	Download

Send Feedback

Authors

Vanhoucke, Mario

Coelho, José

Abstract(s)

This paper present an instance transformation procedure to modify known instances of the resource-constrained project scheduling problem to make them easier to solve by heuristic and/or exact solution algorithms.The procedure makes use of a set of transformation rules that aim at reducing the feasible search space without excluding at least one possible optimal solution. The procedure will be applied to a set of 11,183 instances and it will be shown by a set of experiments that these transformations lead to 110 improved lower bounds,16 new and better schedules (found by three meta-heuristic procedures and a set of branch-and-bound procedures) and even 64 new optimal solutions which were never not found before.