A hyper-heuristic to sequencing mixed-models on assembly-lines minimizing work overload
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/19872
Tipus de documentText en actes de congrés
Data publicació2007
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
There are different approaches for the mixed-model assembly-lines
sequencing problem. In this paper the goal of minimizing
work overload is treated. This approach considers the existence of
time windows in each work stat
ion. Different versions of a
product are considered to be assembled in the line (e.g. car
industry), which require different
processing time according to
the work required in each work station. Long sequences of
rich-work products can lead to produce work overload when
stations cannot fulfil all the assigned tasks. Since solve this
problem optimally is difficult, we
test local search and a hype
r-
heuristic procedure. A computational experiment is used
to detect the performance of the proposed procedures.
CitacióBautista, J.; Cano, J. A hyper-heuristic to sequencing mixed-models on assembly-lines minimizing work overload. A: International Conference on Industrial Engineering and Systems Management. "Actas del congreso". Beijing: 2007, p. 1-10.
ISBN978-7-302-15312-2
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
iesm2007_BC.pdf | 200,8Kb | Visualitza/Obre |