search query: @indexterm Lot-size model / total: 151
reference: 20 / 151
| Author: | Salomon, M. |
| Title: | Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with the windows |
| Journal: | European Journal of Operational Research
1997 : AUG 1, VOL. 100:3, p. 494-513 |
| Index terms: | OPERATIONAL RESEARCH COSTS LOT-SIZE MODEL |
| Language: | eng |
| Abstract: | In this paper the authors consider the Discrete Lotsizing and Scheduling Problem with sequence dependent set-up costs and set-up times (DLSPSD). DLSPSD 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. |
SCIMA