中文摘要：

研究有使用限制的二台机器流水作业排序问题，目标为最小化最大完工时间，工件加工可以被机器的不可用时间段中断．讨论两台机器上均有使用限制离线问题的可近似情形，并给出性能比为3/2的近似算法．同时还考虑在第二台机器上存在一个不可用时间段情况下的半在线问题，给出一个竞争比为3/2的半在线算法．

英文摘要：

This paper investigates the problems for two-machine flow shop scheduling with availability constraints. A resumable scenario is assumed, i.e., if a job cannot be finished before the interval it is continued after the machine becomes available again. The objective is to minimize the makespan. This paper first considers an approximate case of the problem with several availabilitv constraints on both machines, oresents an algorithm with performance ratio of 3/2, then gives an algorithm with competitive ratio of 3/2for the semi-online problem with an availability constraint on the second machine.