"Moderate worst-case complexity bounds for the permutation flowshop ..."

Olivier Ploton, Vincent T'kindt (2023)

> Home

Details and statistics

DOI: 10.1007/S10951-022-00759-1

access: closed

type: Journal Article

metadata version: 2023-04-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/PlotonT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/PlotonT23
Olivier Ploton, Vincent T'kindt:
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. J. Sched. 26(2): 137-145 (2023)

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.