Back to Search

Discrepancy search for the flexible job shop scheduling problem

Title	Discrepancy search for the flexible job shop scheduling problem
Author	Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.
Publication Date:	2010-12
Publication Place	- Elsevier
Subject	Scheduling, Allocation, Flexible jobshop, Discrepancy search, Neighborhood structures
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0305-0548
Record ID	8d401244-9897-4505-8ff8-634710560458
Library Location	Industrial Engineering
Date	2010-12
Notes	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text	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

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

Özyeğin University

Discrepancy search for the flexible job shop scheduling problem

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

Publication Date 2010-12

Publication Place - Elsevier

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

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0305-0548

Record ID 8d401244-9897-4505-8ff8-634710560458

Library Location Industrial Engineering

Date 2010-12

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

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