Use of heuristics for solving cutting stock problems with side constraints – OMP



Company Name / Department OMP
Contact Person Renaud Masson
 Location Wommelgem, Belgium
Optional remote work Remote  60% on monthly basis
Travel expenses (own account or reimbursed by the company) Reimbursed by the company
Housing arranged by company No
Housing expenses (how much per month, own account or subsidized by the company) Not reimbursed
Internship compensation  €450,- per month
Study program Supply chain
ESCF community

Full member

Start date



Company Description

OMP helps companies facing complex planning challenges to excel, grow and thrive by offering the best digitized supply chain planning solution in the market.


Project Description

Project description:

Solving cutting and trimming plans is an essential part of OMP’s offering for the paper and plastic film industries. OMP already has a solution method for these problems relying on mathematical programming. Within the frame of this project the student will investigate the use of heuristic methods to find qualitive solutions for those problems faster.

Goals of the project:

The goal of the project is to come up with proposals for heuristically solving the cutting stock problems that OMP is facing as part of its offering for paper and plastic film, implement a prototype and benchmark it against the currently used implementation.


    • Proposal for a heuristic

    • Prototype of the heuristic

    • Benchmark results

    Essential student knowledge:

    Programming (ideally in C++), Operations Research




    More information:  


    logo vanderWal 240x140