Strong NP-hardness of scheduling problems with learning or aging effect |
| |
| Authors: | Adam Janiak Mikhail Y Kovalyov Maciej Lichtenstein |
| |
| Institution: | 1. Wroc?aw University of Technology, Wroc?aw, Poland
2. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus
|
| |
| Abstract: | Proofs of strong NP-hardness of single machine and two-machine flowshop scheduling problems with learning or aging effect given in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c; Applied Mathematical Modelling 37:1523–1536, 2013) contain a common mistake that make them incomplete. We reveal the mistake and provide necessary corrections for the problems in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; Applied Mathematical Modelling 37:1523–1536, 2013). NP-hardness of problems in Rudek (International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c) remains unknown because of another mistake which we are unable to correct. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
