"A branch-and-bound algorithm with cyclic best-first search for the ..."

Marcus Ritt (2016)

> Home

Details and statistics

DOI: 10.1109/COASE.2016.7743493

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/case/Ritt16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/case/Ritt16
Marcus Ritt:
A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem. CASE 2016: 872-877

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.