Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Heuristics and exact algorithms for solving the Monden problem

Autor
Bautista, J.; Companys, R.; Corominas, A.
Tipus d'activitat
Article en revista
Revista
European journal of operational research
Data de publicació
1996-10
Volum
88
Número
1
Pàgina inicial
101
Pàgina final
113
DOI
https://doi.org/10.1016/0377-2217(94)00165-0 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/0377221794001650 Obrir en finestra nova
Resum
Sequencing units on an assembly line in order to obtain a regular requirement of resources is a problem that can be modelled in a variety of ways. One of the most popular is known as the Monden problem, and the heuristic proposed to obtain a ‘satisfactory’ solution is called ‘goal-chasing’ ethod. In the paper the myopic behaviour of this heuristic is shown, and some improvements are proposed. An exact procedure, based on BDP, is also proposed. By relaxing the assumptions, the BDP procedu...
Paraules clau
Bounded dynamic programming, JIT, Sequencing units on assembly lines
Grup de recerca
OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids

Participants