Lawler’s algorithm is a powerful technique for solving a variety of constrained scheduling problems. The algorithm handles any precedence constraints… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu
- J. Scheduling
- 2016

The well-known O(n2) minmax cost algorithm of Lawler (MANAGE SCI 19(5):544–546, 1973) was developed to minimize the maximum cost… (More)

Is this relevant?

Review

2015

Review

2015

Research investigates how introducing robots affects individuals and organizations. Data are presented from two field studies at… (More)

Is this relevant?

Review

2013

Review

2013

- Thomas A. Clerkin, Kevin J. Jones
- 2013

Decisions made by top management teams and the setting of goals for the organization are of critical importance. It seems likely… (More)

Is this relevant?

2009

2009

The problem of minimizing the weighted sum of completion times when scheduling jobs on a single machine subject to precedence… (More)

Is this relevant?

Review

2009

Review

2009

Sevaux for many enlightening discussions on the topic of this paper. The author gratefully acknowledges the useful comments from… (More)

Is this relevant?

1999

1999

- Michel X. Goemans, David P. Williamson
- SODA
- 1999

In this note we give an alternate proof that a scheduling algorithm of Lawler [E.L. Lawler, Ann. Discrete Math., 2 (1978), pp. 75… (More)

Is this relevant?

1997

1997

- Michel X. Goemans, David P. Williamson, David P. Williamsony
- 1997

LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if… (More)

Is this relevant?

1997

1997

- MaryAnn Lawler
- ACM StandardView
- 1997

tions to the SMI proposal. In this letter, the Chairperson of JTC1, MaryAnn Lawler, puts to rest the series of complaints that… (More)

Is this relevant?

1995

1995

- I. Z. Milis, Vangelis Magirou
- Oper. Res. Lett.
- 1995

The Task Assignment Problem (TAP) arises in distributed computing environments and is a relaxed version of the Quadratic… (More)

Is this relevant?

1990

1990

- E. Andrew Boyd, Ulrich Faigle
- Discrete Applied Mathematics
- 1990

In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now… (More)

Is this relevant?