Modeling lotsizing and scheduling problems with sequence dependent setups

• Type: Article in International Scientific Journal
• Date: 2014

Authors

Luís Guimarães (Author) FEUP; Diego Klabjan (Author) Other; Bernardo Almada Lobo (Author) FEUP

Journal

Title: European Journal of Operational Research

Vol. 239 No. 3

Pages: 644-662

ISSN: 0377-2217

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 25 Citations

ISI Web of Science

Scopus - 34 Citations

Scientific classification

FOS: Engineering and technology

CORDIS: Technological sciences

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 19