"A faster branch-and-bound algorithm for the earliness-tardiness scheduling ..."

Francis Sourd, Safia Kedad-Sidhoum (2008)

> Home

Details and statistics

DOI: 10.1007/S10951-007-0048-2

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/SourdK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/SourdK08
Francis Sourd, Safia Kedad-Sidhoum:
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. J. Sched. 11(1): 49-58 (2008)

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.