Back to Search

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

Title	Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Author	Hmida, A. B., Haouari, Mohamed, Huguet, M.-J., Lopez, P.
Publication Date:	2011-03
Publication Place	- Elsevier
Subject	Scheduling, Two-stage hybrid flow shop, Discrepancy search methods, CDDS, Lower bounds, Heuristics
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0360-8352
Record ID	af17f12c-8883-4dfd-85ab-2271124ec841
Library Location	Industrial Engineering
Date	2011-03
Notes	Fatimah Alnijris Research Chair for Advanced Manufacturing Technology
Sample Text	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

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

Özyeğin University

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

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

Publication Date 2011-03

Publication Place - Elsevier

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

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0360-8352

Record ID af17f12c-8883-4dfd-85ab-2271124ec841

Library Location Industrial Engineering

Date 2011-03

Notes Fatimah Alnijris Research Chair for Advanced Manufacturing Technology

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