A note on a single machine scheduling problem with generalized total tardiness objective function

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 112; H. 3; S. 72 - 76
Hauptverfasser: Gafarov, Evgeny R., Lazarev, Alexander A., Werner, Frank
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 31.01.2012
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Complexity
Computation
Graphical algorithm
Job shops
Mathematical analysis
Mathematical functions
Mathematical models
Number of tardy jobs
Operations research
Polynomials
Production scheduling
Pseudo-polynomial algorithm
Scheduling
Single machine
Studies
Total late work
Total tardiness
Pseudo-polynomial algorithm
Graphical algorithm
Total late work
Scheduling
Number of tardy jobs
Single machine
Total tardiness
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number of tardy jobs on a single machine. The latter algorithm improves the complexity of an existing pseudo-polynomial algorithm by Lawler. Computational results are presented for both special cases considered. ► A single machine problem with a generalized objective function is considered. ► For two special cases, pseudopolynomial algorithms and their graphical modifications are presented. ► Computational results are given for problems with up to 50 jobs.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2011.10.013