| Article ID: | iaor19982387 |
| Country: | Netherlands |
| Volume: | 88 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 113 |
| Publication Date: | Jan 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Bautista J., Companys R., Corominas A. |
| Keywords: | production: FMS, programming: dynamic |
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’ method. 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 procedure becomes a new, powerful heuristic. A sample of computational results is included.