Heuristic to allocate intermediate buffer storage capacities in a production line subject to machine breakdowns

In this research proposal we consider a production line subject to random failures at each workstation and operating under a make-to-stock policy -- Every time a workstation fails, a corrective maintenance activity is triggered to repair the workstation -- In order to palliate the effect of the rand...

Full description

Autores:
Vélez Gallego, Mario César
Jaramillo Jiménez, Jhull Breynner
Tipo de recurso:
Fecha de publicación:
2013
Institución:
Universidad EAFIT
Repositorio:
Repositorio EAFIT
Idioma:
eng
OAI Identifier:
oai:repository.eafit.edu.co:10784/4996
Acceso en línea:
http://hdl.handle.net/10784/4996
Palabra clave:
ANÁLISIS ESTOCÁSTICO
PROGRAMACIÓN HEURÍSTICA
ALGORITMOS GENÉTICOS
PROCESOS ESTOCÁSTICOS
OPTIMIZACIÓN COMBINATORIA
ESTACIONES DE TRABAJO
INVENTARIOS
MANTENIMIENTO
PLANIFICACIÓN DE LA PRODUCCIÓN
Stochastic analysis
Heuristic programming
Genetic algorithms
Stochastic processes
Combinatorial optimization
Microcomputer workstations
Inventories
Maintenance
Production planning
Fallos aleatorios
Gestión de inventarios
Estaciones de trabajo
Rights
License
Acceso restringido
Description
Summary:In this research proposal we consider a production line subject to random failures at each workstation and operating under a make-to-stock policy -- Every time a workstation fails, a corrective maintenance activity is triggered to repair the workstation -- In order to palliate the effect of the random failures in the performance of the system, intermediate buffers are placed in-between workstations -- An inventory holding cost is associated to eachbuffer -- The research objective in this work is to allocate capacity to each intermediate buffer in the line so that the average cost per time unit is minimized while the average service level is kept above a minimum pre-specified value -- In this paper we assume that unsatisfied demand is lost and the service level is defined as the long term proportion of satisfied demand -- A greedy simulation–based heuristic is presented to find a feasible solution to the problem