Normal view MARC view

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: Van Wassenhove, Luk N. ; Dumas, Y. ; Salomon, M. ; Solomon, M. M ; Dumas, Yvan ; Dauzère-Pérès, StéphaneINSEAD Area: Technology and Operations ManagementIn: European Journal of Operational Research, vol. 100, no. 3, aug. 1997 Language: EnglishDescription: p. 494-513.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: In this paper we 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 shows that the algorithm is the first one capable of solving DLSPSD problems of moderate size to optimality with reasonable computational effort
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Call number Status Date due
INSEAD Article Doriot Library
Available

Please ask the Library for this article

In this paper we 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 shows that the algorithm is the first one capable of solving DLSPSD problems of moderate size to optimality with 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?