Back to Results
First PageMeta Content
Theoretical computer science / Job shop scheduling / Constraint programming / Sequence-dependent setup / Mathematical optimization / Travelling salesman problem / Operations research / Applied mathematics / Mathematics


Job shop scheduling with setup times and maximal time-lags: A simple constraint programming approach Diarmuid Grimes1 and Emmanuel Hebrard1,2 1 Cork Constraint Computation Centre & University College Cork, Ireland
Add to Reading List

Document Date: 2010-11-22 06:22:31


Open Document

File Size: 240,57 KB

Share Result on Facebook

City

Toulouse / /

Company

Intel / /

Country

France / Ireland / /

/

Facility

University College Cork / /

IndustryTerm

search strategies / steel industry / final search state / chemical reactions / hybrid constructive/tabu search algorithm / search heuristic / genetic algorithm / search hybrid / pharmaceutical industry / dichotmic search / greedy algorithm / local search / genetic algorithms / diverse solutions / Local search algorithms / elite solutions / chemical industries / tabu search / search attempt / search variable / systematic search performance / bottleneck algorithm / art algorithms / guided local search / food industry / adaptive learning-based search heuristics / bound search / search space / brute-force search speed / dichotomic search / search engine / tabu search method / steel / /

OperatingSystem

Fedora / /

Organization

Cork Constraint Computation Centre / /

Position

salesman / /

Product

Sangean SR3 Radio / /

ProvinceOrState

Georgia / /

Technology

JSP / artificial intelligence / Hybrid genetic algorithms / greedy algorithm / genetic algorithm / Local search algorithms / search engine / dom / shifting bottleneck algorithm / art algorithms / hybrid constructive/tabu search algorithm / /

URL

http /

SocialTag