Skip to search formSkip to main contentSemantic Scholar
You are currently offline. Some features of the site may not work correctly.
Lawler's algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
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
Is this relevant?
Review
2016
Review
2016
Humans have been observing animals for thousands of years, managing some species so extensively as to have led to domestication… Expand
Is this relevant?
2016
2016
This dissertation traces the long, winding, and problematic road along which marriage became a sacrament of the Church. In so… Expand
Is this relevant?
2014
2014
The purpose of this study is to investigate the impact of the leader's change-promoting behavior on employee's readiness for… Expand
Is this relevant?
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… Expand
Is this relevant?
1999
1999
This study discusses nursing ethics in relation to basic care. The practice of basic care andrelated knowledge are often… Expand
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… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
We study the problem of minimizing, in the preemptive case, the number of late jobs on a single machine (1|pmtn,r"j|@?U"j). This… Expand
Is this relevant?
1997
1997
This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on m identical… Expand
Is this relevant?
Review
1983
Review
1983
There has been a long history of interest in the psychometric quality of subjective perfomance ratings. Some confusion, however… Expand
Is this relevant?