Abstract
This paper deals with discrete-continuous problems of planning and scheduling jobs that cannot be pre-empted The need for reusability and modularity leads us to build a generic simulation and optimization framework, which is described in this contribution. The validation of our platform is presented in terms of an application to an actual highly constrained discrete-continuous problem.
Acknowledgements
This work is part of a project subsidized by the Walloon Region, projects Nr. 991/4274 and 991/4367.
The authors would like to thank the members of CREGI and the staff at Fontainunion who contributed to this work.