Three-tank hoist scheduling problem with unbounded or zero-width processing windows

Fabien Mangione (1) , Nadia Brauner (2) , Bernard Penz (1)

1 GILCO - Gestion Industrielle Logistique et Conception
2 Leibniz - IMAG - Laboratoire Leibniz

On surface treatment lines, the products are transferred in successive tanks by a hoist. Aninteresting problem for this kind of lines is to find the hoist moves which maximise productivity. Moreover, each processing time is nested between a minimal and a maximal duration. This constraint is called the processing window constraint. This paper deals with a production of identical parts in a balanced three-tank line. We prove that for zero-width or unbounded processing windows, 1- and 2-cycles are optimal.

Domaines: Recherche opérationnelle [math.OC]

Fabien Mangione, Nadia Brauner, Bernard Penz. Three-tank hoist scheduling problem with unbounded or zero-width processing windows. 8th International Workshop on Project Management and Scheduling - PMS, 2003, Valencia, Spain. pp.253-256. ⟨hal-00259524⟩