Back to Results
First PageMeta Content
Theoretical computer science / Job shop scheduling / Algorithm / Mathematical optimization / NP / Optimization problem / Search algorithm / Monte Carlo method / Shifting bottleneck heuristic / Applied mathematics / Operations research / Mathematics


Proactive Algorithms for Scheduling with Probabilistic Durations∗ J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto, Canada
Add to Reading List

Document Date: 2006-01-18 12:07:28


Open Document

File Size: 149,93 KB

Share Result on Facebook

City

New York / Vienna / /

Company

ILOG SA. / Wilson / UK Planning Special Interest Group / /

Country

Austria / /

/

Facility

Eindhoven University of Technology / Industrial Engineering University of Toronto / /

IndustryTerm

constraint-based search / deterministic solutions / tree search / good deterministic solutions / larger problems such algorithms / branch-and-bound algorithms / tabu search algorithm / statistical computing / probabilistic solution / constraint-based filtering algorithm / tabu search implementation / large search space / deterministic branch-and-bound search / good deterministic solution / taboo search algorithm / branch-and-bound filtering algorithm / branch-and-bound algorithm / particular solution / basic algorithm / search algorithms / deterministic solution / systematic search / Then search / constraint-based filtering algorithms / deterministic filtering algorithms / tabu-based filtering algorithm / spent generating solutions / overall search / partial solution / extreme filtering algorithm / deterministic filtering algorithm / heuristic algorithms / mean solution / tabu search / subsequent search / search tree / local search filtering algorithms / constraint-based search technique / search space / branch-and-bound search / /

MarketIndex

set 10 / /

MusicGroup

B&B / /

OperatingSystem

Linux / /

Organization

Probabilistic Durations∗ J. Christopher Beck Department of Mechanical / Foundation for Statistical Computing / Eindhoven University of Technology / Science Foundation Ireland / Department of Mathematics and Computing Science / Nic Wilson Cork Constraint Computation Centre Department of Computer Science University College Cork / University of Toronto / /

Person

Ai / J. Christopher Beck / /

Position

theoretic model of Beck / Scheduler / /

ProgrammingLanguage

NIL / /

ProvinceOrState

New York / /

Technology

Three algorithms / 3.4 Local Search Filtering Algorithms / 3.3 Branch-and-Bound Filtering Algorithms / Linux / taboo search algorithm / tabu-based filtering algorithm / extreme filtering algorithm / constraint-based algorithms / B&B-I-BS algorithm / two deterministic filtering algorithm / constraint-based filtering algorithm / TSAB algorithm / 1 2 3 4 5 6 7 8 9 Algorithm / branch-and-bound algorithm / qdec end return s∗ Algorithm / B&B algorithms / Algorithm Details The branch-and-bound algorithms / two algorithms / 3 Algorithms / 1.129 Algorithms / heuristic algorithms / JSP / artificial intelligence / deterministic filtering algorithms / six algorithms / filtering algorithms / return s∗ Algorithm / two constraint-based filtering algorithms / branch-and-bound filtering algorithm / simulation / tabu search algorithm / six search algorithms / two local search filtering algorithms / B&B-DQ-L algorithm / basic algorithm / /

SocialTag