Book chapter
Single machine scheduling: an upper bound on maximum lateness
P. 64.
The following classical NP-complete scheduling problem is considered.
Publication based on the results of:
Data Analysis and Decision Making in Socio-Economic and Political Systems(2015)