## Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem

- Veronique Sels, José Coelho, António Manuel Dias, Mario Vanhoucke
- Computers & OR
- 2015

Highly Influenced

@article{FanjulPeyro2010IteratedGL, title={Iterated greedy local search methods for unrelated parallel machine scheduling}, author={Luis Fanjul-Peyro and Rub{\'e}n Ruiz}, journal={European Journal of Operational Research}, year={2010}, volume={207}, pages={55-69} }

- Published 2010 in European Journal of Operational Research
DOI:10.1016/j.ejor.2010.03.030

This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of the maximum completion time of the jobs, commonly referred to as makespan (Cmax). Many algorithms and… CONTINUE READING

Showing 1-10 of 39 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential