Strong NP-hardness of two-machine flow-shop scheduling with periodic due dates(具有等间隔工期的2台机器流水作业调度问题的强NP难性) by 崔晓龙(CUI Xiaolong), 何周力(HE Zhouli), 梅嘉杰(MEI Jiajie), 万龙(WAN Long)

Get full text