Lawler's algorithm

Known as: Lawler’s Algorithm 
Lawler’s algorithm is a powerful technique for solving a variety of constrained scheduling problems. The algorithm handles any precedence constraints… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2015
012319742015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The well-known O(n2) minmax cost algorithm of Lawler (MANAGE SCI 19(5):544–546, 1973) was developed to minimize the maximum cost… (More)
Is this relevant?
Review
2015
Review
2015
Research investigates how introducing robots affects individuals and organizations. Data are presented from two field studies at… (More)
Is this relevant?
Review
2013
Review
2013
Decisions made by top management teams and the setting of goals for the organization are of critical importance. It seems likely… (More)
Is this relevant?
2009
2009
The problem of minimizing the weighted sum of completion times when scheduling jobs on a single machine subject to precedence… (More)
  • figure 1
  • figure 2
Is this relevant?
Review
2009
Review
2009
Sevaux for many enlightening discussions on the topic of this paper. The author gratefully acknowledges the useful comments from… (More)
Is this relevant?
1999
1999
In this note we give an alternate proof that a scheduling algorithm of Lawler [E.L. Lawler, Ann. Discrete Math., 2 (1978), pp. 75… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1997
1997
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if… (More)
Is this relevant?
1997
1997
tions to the SMI proposal. In this letter, the Chairperson of JTC1, MaryAnn Lawler, puts to rest the series of complaints that… (More)
Is this relevant?
1995
1995
The Task Assignment Problem (TAP) arises in distributed computing environments and is a relaxed version of the Quadratic… (More)
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1990
1990
In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now… (More)
Is this relevant?