Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An exact borderline between the NP-hard and polynomial-time solvable cases ..."

Alexander V. Kononov, Marina Pakulich (2024)

> Home

Details and statistics

DOI: 10.1007/S10878-024-01121-1

access: closed

type: Journal Article

metadata version: 2024-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/KononovP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/KononovP24
Alexander V. Kononov, Marina Pakulich:
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. J. Comb. Optim. 47(3): 45 (2024)

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.