Complexity results for single-machine scheduling with positional learning effects |
| |
Authors: | B M T Lin |
| |
Institution: | 1.National Chiao Tung University,Hsinchu,Taiwan |
| |
Abstract: | This note presents complexity results for a single-machine scheduling problem of minimizing the number of late jobs. In the studied problem, the processing times of the jobs are defined by positional learning effects. A recent paper proposed a polynomial time algorithm for the case with a common due date and conjectured the general problem to be ????-hard. We confirm that the general problem is strongly ????-hard and show that the studied problem remains ????-hard even if there are only two different due-date values. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|