Citation
Minimizing the Makespan and Total Flow Time on the Permutation Flow Shop Scheduling Problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 479-506, 2009.
Paper
Abstract
We present a method based on the Multi-Objective Simulated Annealing techniques. Results of the computational experiment indicate that the proposed algorithms provide efficient solutions with little computational effort. For all the tested instances a net set of potentially efficient schedules has been obtained and compared with previously published results.
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{2009-479-506-P, author = {E. Mokotoff},
title = {Minimizing the Makespan and Total Flow Time on the Permutation Flow Shop Scheduling Problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {479--506},
note = {Paper},
abstract = {We present a method based on the Multi-Objective Simulated Annealing techniques. Results of the computational experiment indicate that the proposed algorithms provide efficient solutions with little computational effort. For all the tested instances a net set of potentially efficient schedules has been obtained and compared with previously published results.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-479-506-P.pdf} }