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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 112; číslo 3; s. 72 - 76
Hlavní autori:	Gafarov, Evgeny R., Lazarev, Alexander A., Werner, Frank
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 31.01.2012 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!