Citation
A Comparison Of Different Formulations For The Non-preemptive Single Machine Total Weighted Tardiness Scheduling Problem. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 643-651, 2005.
Paper
Abstract
In this paper, the computational performance of four different formulations for the single machine total weighted tardiness (SMTWT) problems is studied. These formulations are based on start and completion time variables, time index variables, linear ordering variables and positional assignment variables. Experimentation documented in this paper leads to the conclusion that the most appropriate formulation depends on the sum of the processing times of 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-643-651-P, author = {K. Khowala and A. Keha and J. Fowler},
title = {A Comparison Of Different Formulations For The Non-preemptive Single Machine Total Weighted Tardiness Scheduling Problem},
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 = {643--651},
note = {Paper},
abstract = {In this paper, the computational performance of four different formulations for the single machine total weighted tardiness (SMTWT) problems is studied. These formulations are based on start and completion time variables, time index variables, linear ordering variables and positional assignment variables. Experimentation documented in this paper leads to the conclusion that the most appropriate formulation depends on the sum of the processing times of the jobs.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-643-651-P.pdf} }