In this paper, the sequencing of a mixed model paced assembly line is investigated assuming the component parts usage smoothing as the goal of the sequence selection. This sequencing problem, commonly known as Toyota Goal Chasing method, is studied here taking into account not only the traditional Goal Chasing approaches, which assume zero-length assembly lines, but also models which consider the effective length of the assembly line. This means that the number of workstations and their extensions become critical parameters in the selection of the optimal sequence of models to be assembled: in fact, the epochs corresponding to the requirement of different components vary in accordance to the values of the line parameters. The sequencing of the parts is carried out here through a set of heuristic procedures, the commonly adopted Goal Chasing algorithms and a simulated annealing, whose performances are compared with respect to different line scenarios. In particular, the numbers of workstations, parts to be worked and components to be assembled are varied to statistically test their influence on the efficiency of the optimizing procedures and on the differences between zero and finite length approaches.

A comparative analysis of sequencing heuristics for solving the Toyota Goal Chasing problem

CELANO, GIOVANNI;COSTA, ANTONIO;FICHERA, Sergio
2004-01-01

Abstract

In this paper, the sequencing of a mixed model paced assembly line is investigated assuming the component parts usage smoothing as the goal of the sequence selection. This sequencing problem, commonly known as Toyota Goal Chasing method, is studied here taking into account not only the traditional Goal Chasing approaches, which assume zero-length assembly lines, but also models which consider the effective length of the assembly line. This means that the number of workstations and their extensions become critical parameters in the selection of the optimal sequence of models to be assembled: in fact, the epochs corresponding to the requirement of different components vary in accordance to the values of the line parameters. The sequencing of the parts is carried out here through a set of heuristic procedures, the commonly adopted Goal Chasing algorithms and a simulated annealing, whose performances are compared with respect to different line scenarios. In particular, the numbers of workstations, parts to be worked and components to be assembled are varied to statistically test their influence on the efficiency of the optimizing procedures and on the differences between zero and finite length approaches.
2004
Assembly line; Heuristic algorithms; Sequencing
File in questo prodotto:
File Dimensione Formato  
2004_RCIM_MMAL.pdf

solo gestori archivio

Tipologia: Versione Editoriale (PDF)
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 253.27 kB
Formato Adobe PDF
253.27 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/3504
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 8
social impact