Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

Highly Cited

2009

Highly Cited

2009

In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates… Expand

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

Highly Cited

1999

Highly Cited

1999

The goal of this paper is to identify the most efficient algorithms for the optimum mean cycle and optimum cost to time ratio… Expand

1999

1999

This study discusses nursing ethics in relation to basic care. The practice of basic care andrelated knowledge are often… Expand

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

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

1996

1996

We consider the problem of scheduling n groups of jobs on a single machine where three types of decisions are combined… Expand

Highly Cited

1991

Highly Cited

1991

The Origins of the Impossibility Theorem (K.J. Arrow). Mathematical Programming: Journals, Society, Recollections (M.L. Balinski… Expand