Back to Search

Energetic reasoning revisited: application to parallel machine scheduling

Title	Energetic reasoning revisited: application to parallel machine scheduling
Author	Hidri, L., Gharbi, A., Haouari, Mohamed
Publication Date:	2008-08
Publication Place	- Springer Science+Business Media
Subject	Scheduling, Release dates, Due dates, Makespan, Feasibility and adjustment procedures, Energetic reasoning, Branch-and-bound
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	1094-6136
Record ID	529d1567-e823-4b6e-af11-680f76ec7bac
Library Location	Industrial Engineering
Date	2008-08
Notes	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text	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 theclassical 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.
DOI	10.1007/s10951-008-0070-z
Cilt	11

View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine

Özyeğin University

Energetic reasoning revisited: application to parallel machine scheduling

Author Hidri, L., Gharbi, A., Haouari, Mohamed

Publication Date 2008-08

Publication Place - Springer Science+Business Media

Subject Scheduling, Release dates, Due dates, Makespan, Feasibility and adjustment procedures, Energetic reasoning, Branch-and-bound

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 1094-6136

Record ID 529d1567-e823-4b6e-af11-680f76ec7bac

Library Location Industrial Engineering

Date 2008-08

Notes Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Sample Text 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 theclassical 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.

DOI 10.1007/s10951-008-0070-z

Cilt 11