MathSciNet Relay Station
MathSciNet bibliographic data
MR2879130 90B35 (68Q17)
Rudek, Radosław The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect. Appl. Math. Comput. 218 (2012), no. 11, 6498–6510.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2016, American Mathematical Society
Privacy Statement