Citation
Large Neighborhood For A Parallel Scheduling Problem With Earlinesstardiness Penalties And A Common Due Date. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 169-184, 2005.
Paper
Abstract
This paper addresses the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a common due date. Since the problem is conjectured NP-hard in the strong sense, we propose a large neighborhood search that can be explored by a pseudo polynomial dynamic program algorithm. Computational experiments are presented and compared to a lower bound in order to verify that their gap is reasonable. They are also compared to simple local search based on moves and swaps between jobs.
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{2005-169-184-P, author = {Y. A. Rios Solis and F. Sourd},
title = {Large Neighborhood For A Parallel Scheduling Problem With Earlinesstardiness Penalties And A Common Due Date},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {169--184},
note = {Paper},
abstract = {This paper addresses the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a common due date. Since the problem is conjectured NP-hard in the strong sense, we propose a large neighborhood search that can be explored by a pseudo polynomial dynamic program algorithm. Computational experiments are presented and compared to a lower bound in order to verify that their gap is reasonable. They are also compared to simple local search based on moves and swaps between jobs.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-169-184-P.pdf} }