Energetic reasoning revisited: application to parallel machine scheduling

Authors:
Lotfi Hidri;Anis Gharbi;Mohamed Haouari
Affiliations:
Combinatorial Optimization Research Group--ROI, Ecole Polytechnique de Tunisie, La Marsa, Tunisia 2078;Department of Industrial Engineering, College of Engineering, King Saud University, Riyadh, Saudi Arabia 11421;Faculty of Economics and Administrative Sciences, Özyegin University, Istanbul, Turkey
Venue:
Journal of Scheduling
Year:
2008

Citing 7
Cited 2

A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An algorithm for solving the job-shop problem

Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Optimal parallel machines scheduling with availability constraints

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

INFORMS Journal on Computing
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

An approximative criterion for the potential of energetic reasoning

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve the classical energetic reasoning approach. Computational results carried out on a set of hard instances provide strong evidence that the performance of a state-of-the-art exact branch-and-bound algorithm is substantially improved through embedding the proposed enhanced energetic reasoning.