Exponential Algorithms for the Two Parallel Machine Scheduling Problem

Christophe Lenté (1) , Matthieu Liedloff (2) , Ameur Soukhal (1) , Vincent t'Kindt (1)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
2 LITA - Laboratoire d'Informatique Théorique et Appliquée

We study the solution of the two parallel machine problem with makespac minimization by exponential algorithms. Unsing the standard three-field notation in scheduling, this problem can be referred to as P2||Cmax. We present DP formulations and give a new exponential algorithm based on the Sort & Search technic. Complexity bounds on the worst-case time and space complexities are stated. We also focus on the experimental solution and show that very large instances can be solved.

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Christophe Lenté, Matthieu Liedloff, Ameur Soukhal, Vincent t'Kindt. Exponential Algorithms for the Two Parallel Machine Scheduling Problem. INFORMS Annual Meeting, Nov 2011, Charlotte, United States. ⟨hal-01025764⟩