A Constraint Programming model for food processing industry: a case for an ice cream processing facility

Abstract

This paper presents a Constraint Programming (CP) scheduling model for an ice cream processing facility. CP is a mathematical optimisation tool for solving problems either for optimality (for small-size problems) or good quality solutions (for large-size problems). For practical scheduling problems, a single CP solution model can be used to optimise daily production or production horizon extending for months. The proposed model minimises a makespan objective and consists of various processing interval and sequence variables and a number of production constraints for a case from a food processing industry. Its performance was compared to a Mixed Integer Linear Programming (MILP) model from the literature for optimality, speed, and competence using the partial capacity of the production facility of the case study. Furthermore, the model was tested using different product demand sizes for the full capacity of the facility. The results demonstrate both the effectiveness, flexibility, and speed of the CP models, especially for large-scale models. As an alternative to MILP, CP models can provide a reasonable balance between optimality and computation speed for large problems.

Keywords:

• Constraint Programming
• scheduling
• ice cream processing
• food processing scheduling

Supplemental data

Supplemental data for this article can be accessed http://dx.doi.org/10.1080/00207543.2019.1571250.

ORCID

Weihang Zhu http://orcid.org/0000-0002-6092-1608

Additional information

Funding

This work was supported by National Science Foundation [grant number 1457880, 1608886].