The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Lawler’s minmax cost algorithm: optimality conditions and uncertainty

På svenska

Author

  • Nadia Brauner
  • Gerd Finke
  • Yakov Shafransky
  • Dzmitry Sledneu

Summary, in English

The well-known O(n^2) minmax cost algorithm of Lawler (MANAGE SCI 19(5):544–546, 1973) was developed to minimize the maximum cost of jobs processed by a single machine under precedence constraints. We propose two results related to Lawler’s algorithm. Lawler’s algorithm delivers one specific optimal schedule while there can exist other optimal schedules. We present necessary and sufficient conditions for the optimality of a schedule for the problem with strictly increasing cost functions. The second result concerns the same scheduling problem under uncertainty. The cost function for each job is of a special decomposable form and depends on the job completion time and on an additional numerical parameter, for which only an interval of possible values is known. For this problem we derive an O(n^2) algorithm for constructing a schedule that minimizes the maximum regret criterion . To obtain this schedule, we use Lawler’s algorithm as a part of our technique.

Publishing year

2015-01-04

Language

English

Publication/Series

Journal of Scheduling

Document type

Journal article

Publisher

Springer

Topic

  • Computer Science

Keywords

  • Lawler’s minmax cost algorithm
  • Uncertainty
  • Maximum regret

Status

Published

ISBN/ISSN/Other

  • ISSN: 1094-6136