#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1991

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein
- Math. Oper. Res.
- 1997

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of theâ€¦ (More)

- Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein
- Algorithmica
- 1997

We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of schedulingâ€¦ (More)

- Cynthia A. Phillips, Clifford Stein, Joel Wein
- Math. Program.
- 1998

A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobsâ€¦ (More)

- David B. Shmoys, Clifford Stein, Joel Wein
- SODA
- 1991

In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequence of operations, each of which must be processed on a specified machine, and the aim is to completeâ€¦ (More)

- David B. Shmoys, Joel Wein, David P. Williamson
- SIAM J. Comput.
- 1995

- Leslie A. Hall, David B. Shmoys, Joel Wein
- SODA
- 1996

Time-indexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of single-mxhine scheduling problems. We show thatâ€¦ (More)

- Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein
- SPAA
- 1996

Jeanette Schmidt~ R. N. Uma$ Joel Wein~ We consider the problem of scheduling a parallel loop with independent iterations on a network of heterogeneous workstations, and demonstrate the effectivenessâ€¦ (More)

- Cynthia A. Phillips, R. N. Uma, Joel Wein
- SODA
- 2000

We consider a class of scheduling problems which includes a variety of problems that are exceedingly diicult to approximate (unless P=NP). In the face of very strong hardness results, we consider aâ€¦ (More)

including environments with parallelizable jobs, jobs contending for shared resources, tree precedence-constrained jobs, as well as shop scheduling models. In several of these cases, we give theâ€¦ (More)

- Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
- SODA
- 1998

Recently there has been much progress on the design of ap proximation algorithms for a variety of scheduling problems in which the goal is to minimize the average weighted com pletion time of theâ€¦ (More)