Loading...
Loading...

Go to the content (press return)

Heuristics and exact algorithms for solving the Monden problem

Author
Bautista, J.; Companys, R.; Corominas, A.
Type of activity
Journal article
Journal
European journal of operational research
Date of publication
1996-10
Volume
88
Number
1
First page
101
Last page
113
DOI
https://doi.org/10.1016/0377-2217(94)00165-0 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/0377221794001650 Open in new window
Abstract
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...
Keywords
Bounded dynamic programming, JIT, Sequencing units on assembly lines
Group of research
OPE-PROTHIUS -

Participants