Normal view MARC view

Discrete lotsizing and scheduling with sequence dependent setup times and setup costs

Author: Salomon, M. ; Solomon, M. M ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations Management Series: Working Paper ; 94/46/TM Publisher: Fontainebleau : INSEAD, 1994.Language: EnglishDescription: 18 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: In this paper we consider the discrete lotsizing and scheduling problem with sequence dependent setup costs and setup times (DLSPSD). DLSPSD contains elements from sequencing, and is known to be NP-hard. An exact solution procedure for DLSPSD is developed, based on a transformation of DLSP into a traveling salesman problem with times windows (TSPTW). TSPTW is solved by a novel dynamic programming approach due to Dumas et al. (1993). The results of a computational study show that the algorithm is the first one capable of solving DLSPSD problems of moderate size to optimality with a reasonable computational effort
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 we consider the discrete lotsizing and scheduling problem with sequence dependent setup costs and setup times (DLSPSD). DLSPSD contains elements from sequencing, and is known to be NP-hard. An exact solution procedure for DLSPSD is developed, based on a transformation of DLSP into a traveling salesman problem with times windows (TSPTW). TSPTW is solved by a novel dynamic programming approach due to Dumas et al. (1993). The results of a computational study show that the algorithm is the first one capable of solving DLSPSD problems of moderate size to optimality with a reasonable computational effort

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?