Scheduling jobs of equal length: complexity and facets

  • Yves Crama
  • Alwin G. Oerlemans
  • Frits C. R. Spieksma
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 414)


The following problem is studied in this chapter. Given axe n jobs, which have to be processed on a single machine within a fixed timespan {1, 2, ..., T}. The processing time, or length, of each job equals p, pIN. The processing cost of each job is an arbitrary function of its start-time: we denote by c jt the cost of starting job j at time t. The problem is to schedule all jobs so as minimize the sum of the processing costs. We refer to this problem as problem SEL (Scheduling jobs of Equal Length).


Feasible Solution Assignment Problem Processing Cost Valid Inequality 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Yves Crama
    • 1
  • Alwin G. Oerlemans
    • 2
  • Frits C. R. Spieksma
    • 3
  1. 1.Faculté d’ Economie, de Gestion et de Sciences SocialesUniversité de LiègeLiègeBelgium
  2. 2.Ministerie van FinanciënThe HagueThe Netherlands
  3. 3.Department of MathematicsRijksuniversiteit LimburgMaastrichtThe Netherlands

Personalised recommendations