Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates… 
2017
2017
In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of… 
2014
2014
The purpose of this study is to investigate the impact of the leader's change-promoting behavior on employee's readiness for… 
Highly Cited
2006
Highly Cited
2006
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators… 
Highly Cited
1999
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… 
1999
1999
This study discusses nursing ethics in relation to basic care. The practice of basic care andrelated knowledge are often… 
1997
1997
This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on m identical…