Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,570 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Algorithm
Broader (2)
Industrial engineering
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Scheduling Problem
A. Kvaratskhelia
,
A. Lazarev
2020
Corpus ID: 14660136
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates…
Expand
2017
2017
New algorithms for minimizing the weighted number of tardy jobs on a single machine
D. Hermelin
,
Shlomo Karhi
,
Michael L. Pinedo
,
D. Shabtay
Annals of Operations Research
2017
Corpus ID: 35785528
In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of…
Expand
2014
2014
Impact of Leader's Change-Promoting Behavior on Readiness for Change: A Mediating Role of Organizational Culture
M. Adil
2014
Corpus ID: 37504811
The purpose of this study is to investigate the impact of the leader's change-promoting behavior on employee's readiness for…
Expand
Highly Cited
2006
Highly Cited
2006
Power and emotion in negotiation: Power moderates the interpersonal effects of anger and happiness on concession making
G. A. Kleef
,
C. Dreu
,
Davide Pietroni
,
A. Manstead
2006
Corpus ID: 375767
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators…
Expand
Highly Cited
2001
Highly Cited
2001
Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates
S. Chanas
,
A. Kasperski
2001
Corpus ID: 53775377
Highly Cited
1999
Highly Cited
1999
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
P. Baptiste
Operations Research Letters
1999
Corpus ID: 14119182
1999
1999
Two-dimensional Gantt charts and a scheduling algorithm of Lawler
M. Goemans
,
David P. Williamson
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 260901
In this note we give an alternate proof that a scheduling algorithm of Lawler [E. L. Lawler, Ann. Discrete Math., 2 (1978), pp…
Expand
1999
1999
Reflective Assent in Basic Care: A Study in Nursing Ethics
Krister Malmsten
1999
Corpus ID: 53126277
This study discusses nursing ethics in relation to basic care. The practice of basic care andrelated knowledge are often…
Expand
1997
1997
Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays
F. Guinand
,
Christophe Rapine
,
D. Trystram
IEEE Trans. Parallel Distributed Syst.
1997
Corpus ID: 45128688
This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on m identical…
Expand
Highly Cited
1991
Highly Cited
1991
History of mathematical programming : a collection of personal reminiscences
J. Lenstra
,
A. Kan
,
A. Schrijver
1991
Corpus ID: 60500280
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE