Advertisement

Single machine problems

Chapter
  • 121 Downloads

Abstract

[Hoogeveen, 1992b] studies the general problem of the minimisation of K functions of the completion times, denoted by f max i and assumed to be increasing. We have \( f_{\max }^i\left( S \right) = \mathop {\max }\limits_{j = 1, \ldots ,n} f_j^i\left( {{C_j}\left( S \right)} \right) \) with f j i being also increasing functions. Hoogeveen proposes an a posteriori algorithm for the \( 1|| \in \left( {f_{\max }^1/f_{\max }^2, \ldots ,f_{\max }^K} \right) \) problem and distinguishes both bicriteria and mul-ticriteria cases.

Keywords

Completion Time Greedy Algorithm Assignment Problem Dynamic Programming Algorithm Pareto Optimum 
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 2002

Authors and Affiliations

  1. 1.Laboratoire d’InformatiqueUniversité François-Rabelais ToursToursFrance

Personalised recommendations