"A comparison of branch-and-bound algorithms for a family scheduling ..."

Simon Dunstall, Andrew Wirth (2005)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2004.03.022

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/DunstallW05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/DunstallW05
Simon Dunstall, Andrew Wirth:
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur. J. Oper. Res. 167(2): 283-296 (2005)

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.