Citation
A Sequential Pair Exchange Approach for Solving Single-Machine Scheduling Problems with General Earliness-Tardiness Penalties. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 299-314, 2005.
Paper
Abstract
This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness-tardiness penalty for the jobs. A sequential pair exchange approach utilizing a job exchange procedure and three previously established properties in common due-date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness-tardiness penalties for the 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-299-314-P, author = {S-W. Lin and S-Y. Chou},
title = {A Sequential Pair Exchange Approach for Solving Single-Machine Scheduling Problems with General Earliness-Tardiness Penalties},
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 = {299--314},
note = {Paper},
abstract = {This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness-tardiness penalty for the jobs. A sequential pair exchange approach utilizing a job exchange procedure and three previously established properties in common due-date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness-tardiness penalties for the jobs.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-299-314-P.pdf} }