Back to Results
First PageMeta Content
Permutations / Abstract algebra / Permutation / Formal languages / Inversion / String / Job shop scheduling / Permutation pattern / Mathematics / Combinatorics / Discrete mathematics


Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem Jean-Charles Billaut1 , Emmanuel Hebrard2 , and Pierre Lopez2 1
Add to Reading List

Document Date: 2012-06-06 05:08:27


Open Document

File Size: 325,58 KB

Share Result on Facebook

City

Toulouse / Tours / /

Company

Sn / CNF / UPS / /

Country

France / /

Currency

pence / /

/

IndustryTerm

Search method / nearoptimal solutions / search tree / sub-optimal solution / near-optimal solutions / feasible solution / approximate solutions / dichotomic search / times search / tree search procedure / approximate solution / solved using a dichotomic search / /

Person

Roche / /

Position

avenue du colonel / /

Product

Sangean SR3 Radio / /

Technology

sorting algorithm / /

SocialTag