Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
Author: Salomon, M. ; Salomon, M. M. ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations Management Series: Working Paper ; 96/02/TM Publisher: Fontainebleau : INSEAD, 1996.Language: EnglishDescription: 20 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 set-up costs and set-up times (DLSPD). DLSPD contains elements from lotsizing and from job scheduling, and is known to be NP-hard. An exact solution procedure for DLSPSD is developed, based on a transformation of DLSPSD into a travelling salesman problem with time 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| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC001142 |
In this paper we consider the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times (DLSPD). DLSPD contains elements from lotsizing and from job scheduling, and is known to be NP-hard. An exact solution procedure for DLSPSD is developed, based on a transformation of DLSPSD into a travelling salesman problem with time 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.