Discrete‐time, economic lot scheduling problem on multiple, non‐identical production lines

Discrete‐time, economic lot scheduling problem on multiple, non‐identical production lines

0.00 Avg rating0 Votes
Article ID: iaor20117815
Volume: 215
Issue: 1
Start Page Number: 89
End Page Number: 96
Publication Date: Nov 2011
Journal: European Journal of Operational Research
Authors: , ,
Keywords: production
Abstract:

This paper deals with a general discrete time dynamic demand model to solve real time resource allocation and lot‐sizing problems in a multimachine environment. In particular, the problem of apportioning item production to distinct manufacturing lines with different costs (production, setup and inventory) and capabilities is considered. Three models with different cost definitions are introduced, and a set of algorithms able to handle all the problems are developed. The computational results show that the best of the developed approaches is able to handle problems with up to 10000 binary variables outperforming general‐purpose solvers and other randomized approaches. The gap between lower and upper bound procedures is within 1.0% after about 500 seconds of CPU time on a 2.66Ghz Intel Core2 PC.

Reviews

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