Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

  title={Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem},
  author={Ethel Mokotoff and J. L. Jimeno},
  journal={Annals OR},
The classical deterministic scheduling problem of minimizing the makespan on unrelated parallel processors is known to be NP-hard in the strong sense. Given the mixed integer linear model with binary decision variables, this paper presents heuristic algorithms based on partial enumeration. Basically, they consist in the construction of mixed integer subproblems, considering the integrality of some subset of variables, formulated using the information obtained from the solution of the linear… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 10 extracted citations

Iterated greedy local search methods for unrelated parallel machine scheduling

European Journal of Operational Research • 2010
View 10 Excerpts
Highly Influenced

prése n tée en vue de l ’ obtention du titre de Docteur en Gestion Exact Algorithms for Scheduling Parallel Machines with Heads and Tails

Pr. Mohamed Haouar i, Pr. Foued Ben Abdelaziz, Pr. Khaled Ghedira, Pr. Habib Chabchoub
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 24 references

Unrelated parallel machine scheduling using local search

C. A. Glass, C. N. Potts, P. Shade
Mathematical and Computational Modelling 20 • 1994
View 4 Excerpts
Highly Influenced

Duality-Based Algorithms for Scheduling Unrelated Parallel Machines

INFORMS Journal on Computing • 1993
View 8 Excerpts
Highly Influenced

Heuristics for scheduling unrelated parallel machines

Computers & OR • 1991
View 5 Excerpts
Highly Influenced

Parallel machines scheduling: A survey

E. Mokotoff
Asia Pacific Journal on Operational Research 18 • 2001
View 1 Excerpt

Similar Papers

Loading similar papers…