"Branch-and-bound algorithms for minimizing total earliness and tardiness ..."

Jeffrey E. Schaller, Jorge M. S. Valente (2019)

> Home

Details and statistics

DOI: 10.1016/J.COR.2019.04.017

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/SchallerV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/SchallerV19
Jeffrey E. Schaller, Jorge M. S. Valente:
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Comput. Oper. Res. 109: 1-11 (2019)

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.