TY  - GEN 
AU  - Vaquerizo, M. Belén
AU  - Baruque, Bruno
AU  - Corchado Rodríguez, Emilio Santiago
PY  - 2012
SN  - 978-3-642-28930-9 (Print) / 978-3-642-28931-6 (Online)
SN  - 0302-9743 (Print) / 1611-3349 (Online)
UR  - http://hdl.handle.net/10366/134870
AB  - The Labour Scheduling problem in the context of any transport company is a complex optimization problem of that belongs to the class of NP-Hard problems. In these cases, it is not viable to try to find an exact solution and therefore, they require...
LA  - en
PB  - Springer Science + Business Media
KW  - Computer Science
TI  - Combining Metaheuristic Algorithms to Solve a Scheduling Problem
ER  -