Discrepancy search for the flexible job shop scheduling problem

Name: Discrepancy search for the flexible job shop scheduling problem
Author: Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.

İsim	Discrepancy search for the flexible job shop scheduling problem
Yazar	Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.
Basım Tarihi:	2010-12
Basım Yeri	- Elsevier
Konu	Scheduling, Allocation, Flexible jobshop, Discrepancy search, Neighborhood structures
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0305-0548
Kayıt Numarası	8d401244-9897-4505-8ff8-634710560458
Lokasyon	Industrial Engineering
Tarih	2010-12
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.
DOI	10.1016/j.cor.2010.03.009
Cilt	37

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Discrepancy search for the flexible job shop scheduling problem

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

Basım Tarihi 2010-12

Basım Yeri - Elsevier

Konu Scheduling, Allocation, Flexible jobshop, Discrepancy search, Neighborhood structures

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0305-0548

Kayıt Numarası 8d401244-9897-4505-8ff8-634710560458

Lokasyon Industrial Engineering

Tarih 2010-12

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

Örnek Metin The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.

DOI 10.1016/j.cor.2010.03.009

Cilt 37