Energetic reasoning revisited: application to parallel machine scheduling

Name: Energetic reasoning revisited: application to parallel machine scheduling
Author: Hidri, L., Gharbi, A., Haouari, Mohamed

İsim	Energetic reasoning revisited: application to parallel machine scheduling
Yazar	Hidri, L., Gharbi, A., Haouari, Mohamed
Basım Tarihi:	2008-08
Basım Yeri	- Springer Science+Business Media
Konu	Scheduling, Release dates, Due dates, Makespan, Feasibility and adjustment procedures, Energetic reasoning, Branch-and-bound
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1094-6136
Kayıt Numarası	529d1567-e823-4b6e-af11-680f76ec7bac
Lokasyon	Industrial Engineering
Tarih	2008-08
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Energetic reasoning revisited: application to parallel machine scheduling

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

Basım Tarihi 2008-08

Basım Yeri - Springer Science+Business Media

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

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1094-6136

Kayıt Numarası 529d1567-e823-4b6e-af11-680f76ec7bac

Lokasyon Industrial Engineering

Tarih 2008-08

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

Örnek Metin 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