Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions

Abstract

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