"The two-machine flowshop total completion time problem: Improved lower ..."

Can Akkan, Selçuk Karabati (2004)

> Home

Details and statistics

DOI: 10.1016/S0377-2217(03)00415-6

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/AkkanK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/AkkanK04
Can Akkan, Selçuk Karabati:
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. Eur. J. Oper. Res. 159(2): 420-429 (2004)

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.