By Topic

A tight MIP formulation for the Discrete Lot-sizing and Scheduling problem with parallel resources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Celine Gicquel ; Laboratoire de Genie Industriel, Grande Voie des Vignes, 92290 Chatenay-Malabry, France ; Michel Minoux ; Yves Dallery ; Jean-Marie Blondeau

We study a production planning problem known as the Discrete Lot-sizing and Scheduling problem with sequence-dependent changeover costs. We consider here the case where there are several identical parallel resources available for production and we propose solving the resulting optimization problem as a mixed-integer program (MIP) using a commercial solver. This is achieved thanks to the extension of an existing tight MIP formulation for the case of a single resource to the case of parallel resources. The results of our computational experiments show that using the proposed solution approach, we are able to provide guaranteed optimal solutions for instances of medium size with a reasonable computational effort.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009