Citation
A Combined Meta-Heuristic with Hyper-Heuristic Approach to the Scheduling of the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 506-513, 2007.
Paper
Abstract
This paper is concerned with makespan minimisation in a hybrid flow shop with sequence dependent setup times and uniform parallel machines. A lower bound on the optimum makespan is derived and several variants of the genetic algorithm with a hybrid representation are proposed. This representation consists of a permutation, that are commonly used in meta-heuristic approaches to flow shop problems, and a list of dispatching rules to be called upon to complete a schedule. The latter resembles what has been recently termed hyper-heuristics (heuristics that “manage” other heuristics). The proposed methods are used to solve instances generated with real world data from a company. Encouraging results are reported.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-506-513-P, author = {J. Antonio Vazquez Rodriguez and S. Petrovic and A. Salhi},
title = {A Combined Meta-Heuristic with Hyper-Heuristic Approach to the Scheduling of the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {506--513},
note = {Paper},
abstract = {This paper is concerned with makespan minimisation in a hybrid flow shop with sequence dependent setup times and uniform parallel machines. A lower bound on the optimum makespan is derived and several variants of the genetic algorithm with a hybrid representation are proposed. This representation consists of a permutation, that are commonly used in meta-heuristic approaches to flow shop problems, and a list of dispatching rules to be called upon to complete a schedule. The latter resembles what has been recently termed hyper-heuristics (heuristics that “manage” other heuristics). The proposed methods are used to solve instances generated with real world data from a company. Encouraging results are reported.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-506-513-P.pdf} }