Note on an economic lot scheduling problem under budgetary and capacity constraints

Note on an economic lot scheduling problem under budgetary and capacity constraints

0.00 Avg rating0 Votes
Article ID: iaor2005912
Country: Netherlands
Volume: 91
Issue: 3
Start Page Number: 229
End Page Number: 234
Publication Date: Jan 2004
Journal: International Journal of Production Economics
Authors: ,
Keywords: production
Abstract:

Setup reduction program has become an important manufacturing strategy in today's competitive business environment. Banerjee et al. studied the impact of capital investment in setup reduction on an economic lot scheduling problem with a limited budget. They followed the common cycle approach to formulate the problem and suggested a heuristic procedure for numerical computation. The solution they obtained for the model without setup reduction is infeasible perhaps due to mathematical and/or computational errors. In this note, we point out the mathematical errors involved in their paper and provide efficient solution algorithms to both setup reduction and without setup reduction models.

Reviews

Required fields are marked *. Your email address will not be published.