Lawler E.L.

E.L. Lawler

Information about the author E.L. Lawler will soon be added to the site.
Found 4 papers in total
Knapsack-like scheduling problems, the Moore–Hodgson algorithm and the tower of sets property
Knapsack-like scheduling problems, the Moore–Hodgson algorithm and the tower of sets property
1994
Suppose there are n jobs, each with a specified processing time, release date, due...
Computing shortest paths in networks derived from recurrence relations
Computing shortest paths in networks derived from recurrence relations
1991
Dynamic programming formulations of optimization problems often call for the...
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
1990
The scheduling problem 1ℝ pmtn,r j ℝΣw j U j calls for n jobs with...
Preemptive scheduling of two uniform machines to minimize the number of late jobs
Preemptive scheduling of two uniform machines to minimize the number of late jobs
1989
Suppose that n jobs, each with a specified processing requirement and due date, are to...
Papers per page: