Bounding strategies for the hybrid flow shop scheduling problem

Name: Bounding strategies for the hybrid flow shop scheduling problem
Author: Hidri, L., Haouari, Mohamed

İsim	Bounding strategies for the hybrid flow shop scheduling problem
Yazar	Hidri, L., Haouari, Mohamed
Basım Tarihi:	2011-07-01
Basım Yeri	- Elsevier
Konu	Scheduling, Hybrid flow shop, Lower bounds, Heuristics
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0096-3003
Kayıt Numarası	d9948359-b82b-4721-811e-735f38da09b3
Lokasyon	Industrial Engineering
Tarih	2011-07-01
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on the concept of revised energetic reasoning. Also, we describe an optimization-based heuristic that requires iteratively solving a sequence of parallel machine problems with heads and tails. We present the results of extensive computational experiments that provide evidence that the proposed bounding procedures consistently improve the best existing ones.
DOI	10.1016/j.amc.2011.02.108
Cilt	217

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Bounding strategies for the hybrid flow shop scheduling problem

Yazar Hidri, L., Haouari, Mohamed

Basım Tarihi 2011-07-01

Basım Yeri - Elsevier

Konu Scheduling, Hybrid flow shop, Lower bounds, Heuristics

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0096-3003

Kayıt Numarası d9948359-b82b-4721-811e-735f38da09b3

Lokasyon Industrial Engineering

Tarih 2011-07-01

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

Örnek Metin In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on the concept of revised energetic reasoning. Also, we describe an optimization-based heuristic that requires iteratively solving a sequence of parallel machine problems with heads and tails. We present the results of extensive computational experiments that provide evidence that the proposed bounding procedures consistently improve the best existing ones.

DOI 10.1016/j.amc.2011.02.108

Cilt 217