A hybrid constraint approach for a real batch sizing and job sequencing problem
Nuno Gomes, Zita Vale, Carlos A. Ramos · 2006
In this paper we solve a scheduling problem of a bottle production industry. This problem refers to a unique production line, and can be classified as a batch sizing and job sequencing problem. Regarding, the flexibility requirements of the generality of industry to solve real problems, we present a solving method based on constraint logic programming (CLP). In this context we introduce a constraint based model of the problem and the corresponding solving method. In order to overcome some efficiency problems of CLP, an alternative method is also represented that integrates some techniques from linear programming. The tests done with the presented methods have shown promising results