#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1992

1997

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sergey Vasil'evich Sevast'janov
- Discrete Applied Mathematics
- 1994

- David P. Williamson, Leslie A. Hall, +4 authors David B. Shmoys
- Operations Research
- 1997

We consider the open shop, job shop, and ow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is N P-complete. The latter result implies that, unless P = N P, there does not exist a… (More)

- Sergey Vasil'evich Sevast'janov
- Math. Oper. Res.
- 1995

- Sergey Vasil'evich Sevast'janov, Wojciech Banaszczyk
- Discrete Mathematics
- 1997

- Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov
- Comput. Geom.
- 1992

- ‹
- 1
- ›