Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of Non-preemptive Shop Scheduling with Two Jobs."

Tamás Kis (2002)

> Home

Details and statistics

DOI: 10.1007/S00607-002-1455-Z

access: closed

type: Journal Article

metadata version: 2020-08-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/Kis02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/Kis02
Tamás Kis:
On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. Computing 69(1): 37-49 (2002)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.