Batch scheduling and transfer line design problems
Abstract
We study a transfer line design problem, in which there are several types of operations to be assigned to stations. If a station is assigned at least one operation of a certain type, it induces a type dependent cost. Precedence relations on the set of operations are given by an arbitrary digraph. The primary objective is to minimize the number of stations and the secondary objective is to minimize the total type dependent cost. An equivalent batch scheduling model is presented. Obtained results include computational complexity, heuristics, ILP formulations and computer experiments.