#### Filter Results:

#### Publication Year

1992

1997

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

- ‹
- 1
- ›