Citation
A Parallel Metaheuristics for the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 96-103, 2007.
Paper
Abstract
In the paper we propose a parallel population-based metaheuristics for solving a single machine scheduling problem with total weighted tardiness criterion and sequence-dependent setup times. It is represented by 1|s_ij|SUM(w_i*T_1) in literature and it belongs to the strongly NP-hard class. Calcu- lations on the representative group of benchmark instances were done and results were compared with the best known from literature. Obtained solutions were better than the benchmark ones in many instances.
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-096-103-P, author = {W. Bozejko and M. Wodecki},
title = {A Parallel Metaheuristics for the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times},
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 = {96--103},
note = {Paper},
abstract = {In the paper we propose a parallel population-based metaheuristics for solving a single machine scheduling problem with total weighted tardiness criterion and sequence-dependent setup times. It is represented by 1|s_ij|SUM(w_i*T_1) in literature and it belongs to the strongly NP-hard class. Calcu- lations on the representative group of benchmark instances were done and results were compared with the best known from literature. Obtained solutions were better than the benchmark ones in many instances.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-096-103-P.pdf} }