On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

0.00 Avg rating0 Votes
Article ID: iaor20102926
Volume: 37
Issue: 1
Start Page Number: 32
End Page Number: 36
Publication Date: Jan 2009
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: integer
Abstract:

We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose solving it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Computational results confirm the benefits of the proposed solution procedure.

Reviews

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