Scheduling and Lot Streaming at Flexible Job Shops. A Constraint Programming Approach.

JUAN MATIAS NOVAS

Congreso; X Congreso Argentino de Ingeniería Industrial - COINI 2017; 2017

AACINI -Asociación Argentina de Carreras de Ingeniería Industrial y Afines

In this contribution, the scheduling at flexible job shops and the lot streaming problem are simultaneously addressed, by means of a novel constraint programming (CP) approach. The proposed CP model can efficiently tackle both the lots splitting, deciding the number of sublots for each lot and the number of parts that belongs to each sublot, and the scheduling of production tasks, assigning the operations on sublots to machines and defining the start and completion times of those activities. Moreover, the CP formulation can easily be adapted in order to cope with different operational policies, such as no-wait or wait schedules, idling or intermitted idling, etc. A set of case studies were solved and good quality solutions were found when minimizing makespan.