中文摘要：

研究了两台机器有使用限制的排序问题,其中一台机器在给定的一个时间段内不可用,而另一台机器一直可用,目标为最小化最大完工时间.每台机器每次至多可以加工一个工件.工件在加工过程中不可中断.对于该问题,文章给出了一个FPTAS（fully polynomial-time approximation scheme）.

英文摘要：

A two-machine scheduling problem in which one machine has an availability constraint and the other is always available is studied in this paper.The objective is to minimize the makespan.Each machine can process at most one job at a time.Preemption is not allowed.An FPTAS（fully polynomial-time approximation scheme）is Presented.