Ren Jianfeng

Jianfeng Ren

Information about the author Jianfeng Ren will soon be added to the site.
Found 1 papers in total
The NP-hardness of minimizing the total late work on an unbounded batch machine
2009
We consider the problem of minimizing the total late work (SUM V j ) on an unbounded...
Papers per page: