Advertisement

The Discrete Lotsizing and Scheduling Problem (DLSP)

  • Marc Salomon
Chapter
  • 72 Downloads
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 355)

Abstract

In this chapter we consider some extensions and generalizations of the Discrete Lotsizing and Scheduling Problem (DLSP), introduced in Chapter 2. These extensions and generalizations may prove useful in practice, and include problems with sequence dependent setup costs, problems with sequence dependent setup times, and parallel machine problems. Moreover, for all problems defined in this chapter, computational complexity results are derived. These results do not only provide an interesting theoretical insight in the “hardness” of the DLSP problem, but may also serve as a good indicator for the computational behaviour of algorithms.

Keywords

Setup Time Parallel Machine Setup Cost Feasibility Problem Feasible Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Marc Salomon
    • 1
  1. 1.Rotterdam School of ManagementErasmus UniversityRotterdamThe Netherlands

Personalised recommendations