Charalambous C.; Fleszar K.
(SINGAPORE5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE, 2012)
The NP-hard problem of scheduling jobs on unrelated parallel machines with the objective of minimizing the makespan is addressed. A variable neighborhood descent heuristic hybridized with mathematical programming is proposed. ...