"A branch-and-bound method for the single-machine scheduling problem under ..."

Walid Hfaiedh et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2014.11.103

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/HfaiedhSKA15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/HfaiedhSKA15
Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel Hadj-Alouane:
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Appl. Math. Comput. 252: 496-502 (2015)

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.