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

Abstract

International audienceOn 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

Similar works

This paper was published in Hal - Université Grenoble Alpes.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.