Résumé

We study a production scheduling problem, which adresses on the one hand the usual operational constraints such as the precedence of operations, time windows, delays, uniqueness of treatment, availability of resources, and waiting times. On the other hand, the problem takes into account possible restricted movements according to production orders. This problem is a variant of a flexible job shop scheduling problem with several types of sequence-dependent constraints. We consider additional sequence-dependent setup times, as well as sequence-dependent transportation and assignment restrictions. We propose a mixed integer programming model (MIP). It is based on the MIP model of a flexible job shop scheduling problem, in which we add those sequence-dependent constraints. We solve it with a general purpose MIP solver.

Détails

Actions

PDF