Scheduling problems, batch scheduling with controllable processing times have deep roots in the real world. 分批排序问题和加工时间可压缩的排序问题有着深刻的根源。
In this paper, we combine above two kinds of the modern sorts, discuss the batch scheduling with controllable processing times problem. 本文将以上两种现代排序模型结合起来,讨论了加工时间可控的分批排序问题。
Scheduling Problem with Controllable Processing Times(CPT) 加工时间可控的排序问题
An Approximation Algorithm for Single Machine Scheduling with Controllable Processing Times(CPT) 加工时间可控的单台机器排序问题的近似算法
A Controllable Scheduling Problem with Discrete Processing Times Using Convex Quadratic Programming Relaxation 凸二次规划松弛方法研究离散加工时间可控排序问题