Citation
Genetic Algorithm for Late Work Minimization in a Flow Shop System. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 455-462, 2007.
Paper
Abstract
The work concerns a genetic algorithm for the flow shop scheduling problem with release times and the late work criterion, which is NP-hard. The proposed meta-heuristic method minimizes the number of units of job processing times executed after their given due dates. We describe the components of this approach and present the analysis of test results. Computational experiments, preceded by an extensive tuning process, were performed for different classes of problem instances in terms of the distribution of release times and due dates over time.
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-455-462-P, author = {M. Sterna and J. Blazewicz and E. Pesch},
title = {Genetic Algorithm for Late Work Minimization in a Flow Shop System},
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 = {455--462},
note = {Paper},
abstract = {The work concerns a genetic algorithm for the flow shop scheduling problem with release times and the late work criterion, which is NP-hard. The proposed meta-heuristic method minimizes the number of units of job processing times executed after their given due dates. We describe the components of this approach and present the analysis of test results. Computational experiments, preceded by an extensive tuning process, were performed for different classes of problem instances in terms of the distribution of release times and due dates over time.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-455-462-P.pdf} }