A computational experiment of covert-AU class of rules for single machine tardiness scheduling problem

This paper deals with the single-machine single-operation job scheduling problem to minimize total weighted (and unweighted) tardiness. A class of heuristic rules that contains both the cost over time (COVERT) rule and the apparent urgency (AU) rule is presented. Computational comparison of 12 rules...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering 1996-04, Vol.30 (2), p.201-209
Main Authors: Alidaee, Bahram, Ramakrishnan, K.R.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Heuristic
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling, sequencing
Statistical analysis
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the single-machine single-operation job scheduling problem to minimize total weighted (and unweighted) tardiness. A class of heuristic rules that contains both the cost over time (COVERT) rule and the apparent urgency (AU) rule is presented. Computational comparison 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 traffic priority index (TPI) rules, total of 14 rules, are compared. Advantages and disadvantages of the rules with respect to four measures of performance are discussed.
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(95)00166-2