Abstract
This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum latene......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
