Resource title

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

Resource image

image for OpenScout resource :: 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

Resource description

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

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/inseadwp1996/96-02.pdf

Resource license

Copyright INSEAD. All rights reserved