Advertisement

Unlimited Capacity Problems

  • Konstantin Kogan
  • Eugene Khmelnitsky
Chapter
  • 271 Downloads
Part of the Applied Optimization book series (APOP, volume 43)

Abstract

This section addresses the scheduling problems characterized by demand as a function of time specified over a finite planning horizon. The problems differ by inventory-related constraints that allow or disallow backlogs and by the form of the objective function.

Keywords

Planning Horizon Switching Point Dual Formulation Inventory Cost Feasible Path 
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 Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Konstantin Kogan
    • 1
  • Eugene Khmelnitsky
    • 2
  1. 1.Department of Computer ScienceCenter for Technological EducationHolonIsrael
  2. 2.Department of Industrial EngineeringTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations