Parallel machine scheduling to minimize total tardiness

By F. Yalaoui, Chengbin Chu. 2002

128 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/0bf58e47406b9b3eb450a9c284ff977fe8acc7ed

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. Y.-D. Kim *
2. G.-C. Lee
3. Rubén Ruiz
4. José Antonio Vázquez Rodríguez

In Industrial and Manufacturing Engineering

1. Y.-D. Kim *
2. G.-C. Lee
3. José Antonio Vázquez Rodríguez
4. Rubén Ruiz

Citations in the corpus

• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (2004, methodology): “These results are consistent with those from studies of Azizoglu and Kirca (1998) and Yalaoui and Chu (2002) for identical parallel machine scheduling problems.”