Synchronization of scarce resources for a parallel machine lotsizing problem

• Author(s): Christian Almeder ; ernardo Sobrinho Simões de Almada Lobo
• Date: 2011
• Persistent ID: http://hdl.handle.net/10216/56802
• Origin: Repositório Aberto da Universidade do Porto
• Subject(s): Ciências tecnológicas; Engenharia; Engenharia industrial; Engenharia de produção industrial
• Document Type: Article
• Language: English

Description

In this paper we present a novel approach to tackle the synchronization of a secondary resource in lotsizing and scheduling problems. This kind of problem occurs in different manufacturing processes (e.g. wafer testing in the semiconductor industry, production and bottling of soft drinks). We consider a scenario of parallel unrelated machines which have to be equipped with a tool or need a special kind of resource for processing. Our approach allows tracing the assignment of these secondary resources across different machines and synchronizing their usage independently of time periods. We present extensions of the general lotsizing and scheduling problem and of the capacitated lotsizing problem. We prove that the latter model is a special case of the first one, but it performs computationally much better. In this paper we present a novel approach to tackle the synchronization of a secondary resource in lotsizing and scheduling problems. This kind of problem occurs in different manufacturing processes (e.g. wafer testing in the semiconductor industry, production and bottling of soft drinks). We consider a scenario of parallel unrelated machines which have to be equipped with a tool or need a special kind of resource for processing. Our approach allows tracing the assignment of these secondary resources across different machines and synchronizing their usage independently of time periods. We present extensions of the general lotsizing and scheduling problem and of the capacitated lotsizing problem. We prove that the latter model is a special case of the first one, but it performs computationally much better.