Three-tank hoist scheduling problem with unbounded or zero-width processing windows
Abstract
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.
Domains
Operations Research [math.OC]
Origin : Files produced by the author(s)