A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

By G.-C. Lee, Y.-D. Kim *. 2004

77 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/44458e77d7dc608f9cc336218f16371258611872

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Rubén Ruiz
2. José Antonio Vázquez Rodríguez

In Industrial and Manufacturing Engineering

1. José Antonio Vázquez Rodríguez
2. Rubén Ruiz
3. Quan-Ke Pan
4. Bahman Naderi

Citations in the corpus

• The hybrid flow shop scheduling problem (2010, methodology): “Problem Comments [181] FH2, ((QM (k))2 k=1))||Cmax heuristics, lower bounds [214] FHm, ((PM (k))m k=1))||Cmax Neural Networks [219] FHm, ((RM (k))m k=1))|Mj |Cmax GA 2004 [1] FHm, ((PM (k))m k=1))||Cmax bottleneck exploiting heuristic [11] FHm, ((PM (k))m k=1))|avail|several simulation, heuristics, ”