A local search approach to job grouping

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


In Chapters 5 and 6, lower and upper bounding procedures were proposed for the job grouping problem. It appeared that, in many cases, sequential heuristic procedures were not sufficient to provide an optimal solution. A column generation approach was also developed to compute a strong lower bound, based on the linear relaxation of the set covering formulation of the job grouping problem. In the course of this procedure, it was sometimes possible to derive improved upper bounds. Notice, however, that solving the job grouping problem may be done faster if a better upper bound is known from the start. For instance, execution of the column generation procedure can be avoided if simple lower bounds like LB SW and LB MSW (see Chapters 5 and 6) are optimal and an optimal upper bound is also available. Alternatively, improved solutions provide additional columns to be included in the set covering formulation, which may speed up the column generation procedure.


Objective Function Local Search Simulated Annealing Tabu Search Neighbourhood Structure 
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