Modeling lotsizing and scheduling problems with sequence dependent setups

• Tipo: Artigo em Revista Científica Internacional
• Data: 2014

Autores

Luís Guimarães (Autor) FEUP; Diego Klabjan (Autor) Outra; Bernardo Almada Lobo (Autor) FEUP

Revista

Título: European Journal of Operational Research

Vol. 239 Nº 3

Páginas: 644-662

ISSN: 0377-2217

Editora: Elsevier

Indexação

ISI Web of Knowledge - 25 Citações

ISI Web of Science

Scopus - 34 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias

CORDIS: Ciências Tecnológicas

Outras Informações

ID Authenticus: P-009-RFJ

DOI: 10.1016/j.ejor.2014.05.018

Resumo (PT): Several production environments require simultaneous planing of sizing and scheduling of sequences of production lots. Integration of sequencing decisions in lotsizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to real world problems. A two-dimensional classification framework is proposed to survey and classify the main modeling approaches to integrate sequencing decisions in discrete time lotsizing and scheduling models. Computational experiments are conducted to assess the performance of various models, in terms of running times and upper bounds, when solving real-word size instances. We also present a new formulation for the problem using commodity flow based subtour elimination constraints.

Abstract (EN): Several production environments require simultaneous planing of sizing and scheduling of sequences of production lots. Integration of sequencing decisions in lotsizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to real world problems. A two-dimensional classification framework is proposed to survey and classify the main modeling approaches to integrate sequencing decisions in discrete time lotsizing and scheduling models. The Asymmetric Traveling Salesman Problem can be an important source of ideas to develop more efficient models and methods to this problem. Following this research line, we also present a new formulation for the problem using commodity flow based subtour elimination constraints. Computational experiments are conducted to assess the performance of the various models, in terms of running times and upper bounds, when solving real-word size instances.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 19