This paper systematically studies the two machine flow-shop scheduling problems with no-wait and deterministic unavailab......

研究带单服务器和相同加工时间的两台机器的流水作业排序问题,证明该问题是强NP-困难的,引入一个简单的贪婪算法证明其紧界是3/2.......