Resource title

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

Resource image

image for OpenScout resource :: Discrete lotsizing and scheduling with sequence dependent setup times and setup costs

Resource description

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

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/Inseadwp1994/94-46.pdf

Resource license

Copyright INSEAD. All rights reserved