Sheldon H. Jacobson

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gio K. Kao

> Home > Persons > Sheldon H. Jacobson

Publications

2012
[j61]
- view
  authority control:
- export record
  dblp key:
  - journals/coap/KaoSJH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/KaoSJH12
Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson, Shane N. Hall:
New dominance rules and exploration strategies for the 1|r_i|∑U_i scheduling problem. Comput. Optim. Appl. 51(3): 1253-1274 (2012)
[j58]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/SewellSMJK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/SewellSMJK12
Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson, Gio K. Kao:
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Glob. Optim. 54(4): 791-812 (2012)
2009
[j49]
- view
  authority control:
- export record
  dblp key:
  - journals/scheduling/KaoSJ09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/KaoSJ09
Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson:
A branch, bound, and remember algorithm for the 1| r _i| Sigma t _i scheduling problem. J. Sched. 12(2): 163-175 (2009)
2008
[j47]
- view
  authority control:
- export record
  dblp key:
  - journals/coap/KaoJ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/KaoJ08
Gio K. Kao, Sheldon H. Jacobson:
Finding preferred subsets of Pareto optimal solutions. Comput. Optim. Appl. 40(1): 73-95 (2008)

a service of

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.