"A branch-and-bound algorithm for the two-machine total completion time ..."

Mohamed Ali Rakrouki et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S12351-017-0308-7

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/or/RakroukiKCL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/or/RakroukiKCL20
Mohamed Ali Rakrouki, Anis Kooli, Sabrine Chalghoumi, Talel Ladhari:
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates. Oper. Res. 20(1): 21-35 (2020)

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.