Normal view MARC view

Heuristics for the discrete lotsizing and scheduling problems with setup times

Author: Van Wassenhove, Luk N. ; Cattrysse, Dirk ; Kuik, Roelof ; Salomon, MarcINSEAD Area: Technology and Operations Management Series: Working Paper ; 91/17/TM Publisher: Fontainebleau : INSEAD, 1991.Language: EnglishDescription: 15 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: In this paper the Discrete Lot-Sizing and Scheduling Problem (DLSP) -that of determining the sequence and size of production batches for multiple items on a single machine- is considered, with setup times. The objective is to find a minimal cost production schedule such that dynamic demand is fulfilled without backlogging. DLSP is formulated as a Set Partitioning Problem (SPP). This paper presents primal and dual heuristics to solve SPP, using column generation. The quality of the solutions can be measured, since the heuristics generate lower and upper bounds. Computational results on a personal computer show that the heuristics are rather effective, both in terms of the quality of the solutions and of required memory and computation time
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
INSEAD Working Paper Digital Library
PDF Available

In this paper the Discrete Lot-Sizing and Scheduling Problem (DLSP) -that of determining the sequence and size of production batches for multiple items on a single machine- is considered, with setup times. The objective is to find a minimal cost production schedule such that dynamic demand is fulfilled without backlogging. DLSP is formulated as a Set Partitioning Problem (SPP). This paper presents primal and dual heuristics to solve SPP, using column generation. The quality of the solutions can be measured, since the heuristics generate lower and upper bounds. Computational results on a personal computer show that the heuristics are rather effective, both in terms of the quality of the solutions and of required memory and computation time

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?