A COMPUTATIONAL EXPERIMENT OF COVERT-AU CLASS OF RULES FOR SINGLE-MACHINE TARDINESS SCHEDULING PROBLEM

Authors
ALIDAEE B RAMAKRISHNAN KR
Citation
B. Alidaee et Kr. Ramakrishnan, A COMPUTATIONAL EXPERIMENT OF COVERT-AU CLASS OF RULES FOR SINGLE-MACHINE TARDINESS SCHEDULING PROBLEM, Computers & industrial engineering, 30(2), 1996, pp. 201-209
Citations number
32
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & industrial engineering → ACNP
ISSN journal
03608352
Volume
30
Issue
2
Year of publication
1996
Pages
201 - 209
Database
ISI
SICI code
0360-8352(1996)30:2<201:ACEOCC>2.0.ZU;2-G
Abstract
This paper deals with the single-machine single-operation job scheduli ng problem to minimize total weighted (and unweighted) tardiness. A cl ass of heuristic rules that contains both the cost over time (COVERT) rule and the apparent urgency (AU) rule is presented. Computational co mparison of 12 rules from this class for the total weighted tardiness problem is presented. In the case of the total tardiness (unweighted) problem, these 12 rules and the modified due date (MDD) and the traffi c priority index (TPI) rules, total of 14 rules, are compared. Advanta ges and disadvantages of the rules with respect to four measures of pe rformance are discussed.