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...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 112; no. 3; pp. 72 - 76
Main Authors:	Gafarov, Evgeny R., Lazarev, Alexander A., Werner, Frank
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.01.2012 Elsevier Sequoia S.A
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!