RESOLUTION OF THE CYCLIC MULTI-HOISTS SCHEDULING PROBLEM WITH OVERLAPPING PARTITIONS

This paper deals with scheduling problem in electroplating facilities. To maximise the productivity of electroplating lines, a predictive ap proach can be used to find a sequence of hoist movements that can be c yclically repeated. This NP-hard problem is known as the Cyclic Hoist Scheduling Problem. An approach for the multi-hoists problem is sugges ted. The presented model uses Constraint Logic Programming for finding the optimal cyclic schedule for a given hoist assignment.