FLOW-SHOP CYCLIC SCHEDULING FOR CYCLIC DELIVERIES

This paper considers a flow shop organised factory which produces n items and which is faced to cyclic delivery schedules based on mean demands. This factory engage to deliver periodically products in varying quantities between a min and a max values. We present in this work, a new approach for establishing cyclic production schedules for flow shops in the context of cyclic deliveries. The approach consists in generating a cyclic production schedule for the last processor using for this a set of heuristics. We after that deduce the cyclic production schedules for the other processors.