Graph approach for balancing a class of transfer lines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

Graph approach for balancing a class of transfer lines

N. Guschinsky
  • Function : Author
G. Levin
  • Function : Author
J.-M. Proth
  • Function : Author

Abstract

The optimal design of automatic transfer lines is considered. To this end, operations are partitioned into blocks. The operations of the same block are performed simultaneously, and different blocks of the same workstation are activated sequentially. Constraints related to the design of blocks and workstations, as well as precedence constraints related to operations, are given. The problem consists in minimizing the total number of workstations and blocks, while reaching a given cycle time and satisfying the above constraints. We develop an exact method which proceeds by setting the problem as a constrained shortest path problem. This method is efficient for small and medium size problems.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4996.pdf (1.27 Mo) Télécharger le fichier

Dates and versions

inria-00071582 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071582 , version 1

Cite

Alexandre Dolgui, N. Guschinsky, G. Levin, J.-M. Proth. Graph approach for balancing a class of transfer lines. RR-4996, INRIA. 2003. ⟨inria-00071582⟩
49 View
36 Download

Share

Gmail Facebook X LinkedIn More