Article ID: | iaor2000767 |
Country: | United Kingdom |
Volume: | 50 |
Issue: | 2 |
Start Page Number: | 138 |
End Page Number: | 147 |
Publication Date: | Feb 1999 |
Journal: | Journal of the Operational Research Society |
Authors: | Kim Y.-D., Park M.-W. |
This paper focuses on a production planning problem in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problem, that is, tardiness is not allowed. The objective of the problem is to minimise holding costs for final product inventory as well as work-in-process inventory. A non-linear mathematical model is presented and a heuristic algorithm is developed using a solution property and a network model for defining solutions of the problem. A series of computational tests were done to compare the algorithm with a commercial planning/scheduling software and backward finite-loading methods that employ various priority rules. The results showed that the suggested algorithm outperformed the others.