Lawler's algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Lawler’s algorithm is a powerful technique for solving a variety of constrained scheduling problems.[1] The algorithm handles any precedence constraints. It schedules a set of simultaneously arriving tasks on one processor with precedence constraints to minimize maximum tardiness or lateness. Precedence constraints occur when certain jobs must be completed before other jobs can be started.

Objective Functions[edit]

The objective function is assumed to be in the form min \, max_{0\le i \le n} \, g_i(F_i), where g_i is any nondecreasing function and F_i is the flow time.[2] When g_i (F_i) = F_i - d_i = L_i, the objective function corresponds to minimizing the maximum lateness, where d_i is due time for job i and L_i lateness of job i. Another expression is g_i (F_i) = max {(F_i-d_i,0)}, which corresponds to minimizing the maximum tardiness.

References[edit]

  1. ^ Steven Nahmias. Production and Operations Analysis. 2008. ISBN 978-0-07-126370-2
  2. ^ Joseph Y-T. Leung. Handbook of scheduling: algorithms, models, and performance analysis. 2004. ISBN 978-1-58488-397-5

Additional readings[edit]