On polynomial solvability of the high multiplicity total weighted tardiness problem

Authors:
Frieda Granot;Jadranka Skorin-Kapov
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1993

Citing 0
Cited 2

Polynomial algorithms for multiprocessor scheduling with a small number of job lengths

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate algorithms for high-multiplicity parallel machine scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.04

Visualization

Abstract