FAQ

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

Related topics

Related topics

3 relations
Algorithm

Broader (2)

Industrial engineeringOperations research

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Lawler's algorithm
Algorithm
Operations research
Industrial engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Lawler's minmax cost algorithm: optimality conditions and uncertainty
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
Investigating the implementation of robotics
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
A Study of Conflict in Top Management Decision Making: the Impact of Contribution Motive
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
A Simpler Primal-Dual Proof of Lawler’s Algorithm
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
TO BE PUBLISHED IN OPERATIONS RESEARCH LETTERS An O(n) Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs
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
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
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
Ibm Research Report Two-dimensional Gantt Charts and a Scheduling Algorithm of Lawler Two-dimensional Gantt Charts and a Scheduling Algorithm of Lawler
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
Section 8. Another major document
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
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
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
An algorithmic characterization of antimatroids
In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now… (More)
Is this relevant?