Lawler’s minmax cost algorithm: optimality conditions and uncertainty - Université Grenoble Alpes Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2016

Lawler’s minmax cost algorithm: optimality conditions and uncertainty

Résumé

The well-known O(n2) minmax cost algorithm of Lawler (MANAGE SCI 19(5):544–546, 1973) was devel- oped 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 con- cerns 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 addi- tional numerical parameter, for which only an interval of possible values is known. For this problem we derive an O(n2) 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.
Fichier non déposé

Dates et versions

hal-01107557 , version 1 (21-01-2015)

Identifiants

Citer

Nadia Brauner, Gerd Finke, Yakov Shafransky, Dzmitry Sledneu. Lawler’s minmax cost algorithm: optimality conditions and uncertainty. Journal of Scheduling, 2016, 19 (4), pp.401-408. ⟨10.1007/s10951-014-0413-x⟩. ⟨hal-01107557⟩
314 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More