Back to Search

Bounding strategies for the hybrid flow shop scheduling problem

Title	Bounding strategies for the hybrid flow shop scheduling problem
Author	Hidri, L., Haouari, Mohamed
Publication Date:	2011-07-01
Publication Place	- Elsevier
Subject	Scheduling, Hybrid flow shop, Lower bounds, Heuristics
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0096-3003
Record ID	d9948359-b82b-4721-811e-735f38da09b3
Library Location	Industrial Engineering
Date	2011-07-01
Notes	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text	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

View in source Özyeğin University Özyeğin University - Ottoman library catalog search

Özyeğin University

Bounding strategies for the hybrid flow shop scheduling problem

Author Hidri, L., Haouari, Mohamed

Publication Date 2011-07-01

Publication Place - Elsevier

Subject Scheduling, Hybrid flow shop, Lower bounds, Heuristics

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0096-3003

Record ID d9948359-b82b-4721-811e-735f38da09b3

Library Location Industrial Engineering

Date 2011-07-01

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

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