Normal view MARC view

The Single item discrete lot-sizing and scheduling problem: optimization by linear and dynamic programming

Author: Van Wassenhove, Luk N. ; Salomon, Marc ; Van Hoesel, Stan ; Kuik, Roelof ; Kroon, Leo G.INSEAD Area: Technology and Operations ManagementIn: Discrete Applied Mathematics, vol. 48, no. 3, February 1994 Language: EnglishDescription: p. 289-303.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: This paper considers the single-item discrete lotsizing and scheduling problem (DLSP). DLSP is the problem of determining a minimal cost production schedule that satisfies demand without backlogging and does not violate capacity constraints. We formulate DLSP as an integer programming problem and present two solution procedures. The first procedure is based on a reformulation of DLSP as a linear programming assignment problem, with additional restrictions to reflect the specific (setup) cost structure. For this linear programming (LP) formulation it is shown that, under certain conditions on the objective, the solution is all integer. The second procedure is based on dynamic progrmming (DP). Under certain conditions on the objective function, the DP algorithm can be made to run very fast by using special properties of optimal solutions
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Call number Status Date due
INSEAD Article Doriot Library
Available

Please ask the Library for this article

This paper considers the single-item discrete lotsizing and scheduling problem (DLSP). DLSP is the problem of determining a minimal cost production schedule that satisfies demand without backlogging and does not violate capacity constraints. We formulate DLSP as an integer programming problem and present two solution procedures. The first procedure is based on a reformulation of DLSP as a linear programming assignment problem, with additional restrictions to reflect the specific (setup) cost structure. For this linear programming (LP) formulation it is shown that, under certain conditions on the objective, the solution is all integer. The second procedure is based on dynamic progrmming (DP). Under certain conditions on the objective function, the DP algorithm can be made to run very fast by using special properties of optimal solutions

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?