A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time

  • Authors:
  • Roberto Spina;Luigi M. Galantucci;Michele Dassisti

  • Affiliations:
  • Dipartimento di Ingegneria Meccanica e Gestionale (DIMeG), Politecnico di Bari-Viale Japigia, 182-70126, Bari, Italy;Dipartimento di Ingegneria Meccanica e Gestionale (DIMeG), Politecnico di Bari-Viale Japigia, 182-70126, Bari, Italy;Dipartimento di Ingegneria Meccanica e Gestionale (DIMeG), Politecnico di Bari-Viale Japigia, 182-70126, Bari, Italy

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.03

Visualization

Abstract

The present paper presents a hybrid approach for solving manufacturing scheduling problems, based on the integration between Constraint Logic Programming (CLP) and Genetic Algorithm (GA) approaches. The proposed methodology is applied to a single line with multiple products and sequence-dependent time. This system model derives from a real case of a company producing sheets for catalytic converters. A sensitivity analysis of the hybrid methodology is carried out to compare the performance of the CLP, GA and integrated CLP-GA approaches.