"Branch-and-bound method for minimizing the weighted completion time ..."

Rabia Nessah, Imed Kacem (2012)

> Home

Details and statistics

DOI: 10.1016/J.COR.2011.05.024

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/NessahK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/NessahK12
Rabia Nessah, Imed Kacem:
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res. 39(3): 471-478 (2012)

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.