Text this: Strong NP-hardness of two-machine flow-shop scheduling with periodic due dates(具有等间隔工期的2台机器流水作业调度问题的强NP难性)