Customize Consent Preferences

We use cookies to help you navigate efficiently and perform certain functions. You will find detailed information about all cookies under each consent category below.

The cookies that are categorized as "Necessary" are stored on your browser as they are essential for enabling the basic functionalities of the site. ... 

Always Active

These cookies are essential to the proper functioning of the website and cannot be disabled by our systems. They are usually only activated in response to actions you perform, such as configuring your privacy settings, logging in, or filling out forms.

These cookies are used to improve website functionality and personalization, such as use of videos and instant messaging services. If you disable functional cookies, some or all of these features may not work properly.

No cookies to display.

These cookies allow us to determine the number of visits and sources of traffic on our site in order to measure and improve site performance. They also help us identify which pages are the most/least visited and assess how visitors use the site. All of the information collected by these cookies is aggregated, and therefore anonymized.

Advertisement cookies are used to provide visitors with customized advertisements based on the pages you visited previously and to analyze the effectiveness of the ad campaigns.

No cookies to display.

Improved solver performance on scheduling problems with start-up time

The research consists in creating a scheduling tool which aims to schedule a series of tasks on a production line composed of a single machine in the food industry. The planning horizon consists of weeks 4 to 8.

The research consists in creating a scheduling tool which aims to schedule a series of tasks (jobs) on a production line composed of a single machine in the food industry. The planning horizon consists of weeks 4-8. The start-up time between tasks should be considered and minimized in order to improve the performance of the production line.

The research project is being conducted in collaboration with the company Biscuits Leclerc.

The company shared some of their data in order to serve as instances. The scheduling includes constraints specific to their reality such as a limit of tasks that can be performed during one single day or the requirement that certain tasks must begin at the beginning of the week. To achieve this, we use constraint programming, an optimization technique derived from artificial intelligence.

The research project involves the following steps:

  • the creation of a model representing the reality of the business;
  • a branching heuristic adapted to the problem;
  • the use of a meta-heuristic aimed at improving the solution;
  • and the implementation of the tool in the company.

Partner Organization

IID Principal Investigators of this project

Research Team

Claude-Guy Quimper, Jonathan Gaudreault, Nicolas Blais (Université Laval)

Project Funding: 2018-2021

Let’s keep in touch!

Would you like to be informed about IID news and activities? Subscribe now to our monthly newsletter.