The economic lot scheduling problem under extended basic period and power-of-two policy

The economic lot scheduling problem under extended basic period and power-of-two policy

0.00 Avg rating0 Votes
Article ID: iaor20103269
Volume: 4
Issue: 2
Start Page Number: 157
End Page Number: 172
Publication Date: May 2010
Journal: Optimization Letters
Authors: , ,
Keywords: programming: integer
Abstract:

The economic lot scheduling problem schedules the production of several different products on a single machine over an infinite planning horizon. In this paper, a nonlinear integer programming model is used to determine the optimal solution under the extended basic period and power-of-two policy. A small-step search algorithm is presented to find a solution which approaches optimal when the step size approaches zero, where a divide-and-conquer procedure is introduced to speed up the search. Further a faster heuristic algorithm is proposed which finds the same solutions in almost all the randomly generated sample cases.

Reviews

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