Search tree based approaches for parallel machine scheduling

Authors:
Emmanuel Néron;Fabrice Tercinet;Francis Sourd
Affiliations:
Université François-Rabelais de Tours - Laboratoire d'Informatique - íquipe OC64, avenue Jean Portalis, 37200 Tours, France;Université François-Rabelais de Tours - Laboratoire d'Informatique - íquipe OC64, avenue Jean Portalis, 37200 Tours, France;Université Pierre et Marie Curie - LIP6 - íquipe SYSDEF 8, rue du Capitaine Scott, 75015 Paris, France
Venue:
Computers and Operations Research
Year:
2008

Citing 5
Cited 4

Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures

Journal of Heuristics
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop

INFORMS Journal on Computing
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines

Operations Research Letters
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

Operations Research Letters

Jackson's semi-preemptive scheduling on a single machine

Computers and Operations Research
Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research
A multiobjective optimization approach to solve a parallel machines scheduling problem

Advances in Artificial Intelligence
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This article compares two branching schemes for the parallel machine scheduling problem with release dates and tails. Both branching schemes can be used for either complete or incomplete search tree based algorithms. In particular, our study aims to prove the robustness of each of them for several search methods. We experimentally compare the efficiency of the two branching schemes when they are used in a branch-and-bound (BnB) method, in a limited discrepancy search, in a branch-and-greed (BnG) method or in a beam search (BS).