Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

3 relations
Algorithm

Broader (2)

Industrial engineeringOperations research

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(n^2)$$O(n2) minmax cost algorithm of Lawler (MANAGE SCI 19(5):544–546, 1973) was developed to minimize the… Expand
  • table 1
2014
2014
Impact of Leader's Change-Promoting Behavior on Readiness for Change: A Mediating Role of Organizational Culture
The purpose of this study is to investigate the impact of the leader's change-promoting behavior on employee's readiness for… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 8
Highly Cited
2009
Highly Cited
2009
scheduling problem
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 8
Highly Cited
2006
Highly Cited
2006
Power and emotion in negotiation: Power moderates the interpersonal effects of anger and happiness on concession making
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1999
Highly Cited
1999
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
The goal of this paper is to identify the most efficient algorithms for the optimum mean cycle and optimum cost to time ratio… Expand
  • table 1
  • figure 1
  • table 2
1999
1999
Reflective Assent in Basic Care: A Study in Nursing Ethics
This study discusses nursing ethics in relation to basic care. The practice of basic care andrelated knowledge are often… Expand
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… Expand
  • figure 4.4
1997
1997
Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays
This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on m identical… Expand
1996
1996
Batch Scheduling and Common Due-date Assignment on a Single Machine
We consider the problem of scheduling n groups of jobs on a single machine where three types of decisions are combined… Expand
  • table 1
Highly Cited
1991
Highly Cited
1991
History of mathematical programming : a collection of personal reminiscences
The Origins of the Impossibility Theorem (K.J. Arrow). Mathematical Programming: Journals, Society, Recollections (M.L. Balinski… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE