Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

Name: Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Author: Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.

İsim	Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Yazar	Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.
Basım Tarihi:	2011-03
Basım Yeri	- Elsevier
Konu	Scheduling, Two-stage hybrid flow shop, Discrepancy search methods, CDDS, Lower bounds, Heuristics
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0360-8352
Kayıt Numarası	af17f12c-8883-4dfd-85ab-2271124ec841
Lokasyon	Industrial Engineering
Tarih	2011-03
Notlar	Fatimah Alnijris Research Chair for Advanced Manufacturing Technology
Örnek Metin	This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on dedicated lower bounds for the two-stage hybrid flow shop problem. We report the results of extensive computational experiments, which show that the proposed adaptation of the CDDS method solves instances in restrained CPU time and with high quality of makespan.
DOI	10.1016/j.cie.2010.11.015
Cilt	60

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

Yazar Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.

Basım Tarihi 2011-03

Basım Yeri - Elsevier

Konu Scheduling, Two-stage hybrid flow shop, Discrepancy search methods, CDDS, Lower bounds, Heuristics

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0360-8352

Kayıt Numarası af17f12c-8883-4dfd-85ab-2271124ec841

Lokasyon Industrial Engineering

Tarih 2011-03

Notlar Fatimah Alnijris Research Chair for Advanced Manufacturing Technology

Örnek Metin This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on dedicated lower bounds for the two-stage hybrid flow shop problem. We report the results of extensive computational experiments, which show that the proposed adaptation of the CDDS method solves instances in restrained CPU time and with high quality of makespan.

DOI 10.1016/j.cie.2010.11.015

Cilt 60