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

Authors:
C. Gicquel;M. Minoux;Y. Dallery
Affiliations:
Ecole Centrale Paris, Laboratoire de Génie Industriel, Grande Voie des Vignes, 92290 Chatenay-Malabry, France;Laboratoire d'Informatique de Paris 6, 4 place Jussieu, 75005 Paris, France;Ecole Centrale Paris, Laboratoire de Génie Industriel, Grande Voie des Vignes, 92290 Chatenay-Malabry, France
Venue:
Operations Research Letters
Year:
2009

Citing 7
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Some extensions of the discrete lotsizing and scheduling problem

Management Science
Discrete Lotsizing and Scheduling by Batch Sequencing

Management Science
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Management Science
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

Management Science
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)

Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.