中文摘要：

研究单台机器有使用限制的排序问题，即机器在给定的一个时间段内不可用，目标为最小化最大完工时间．每个工件都有一个到达时间，只有工件到达了才能加工，工件在加工过程中不可中断．对于该问题的离线情形，给出了一个近似比为4／3的近似算法和一个动态规划算法．对于问题的在线情形，给出了一个最优在线算法．

英文摘要：

In this paper, the problem of scheduling jobs on a single machine with an availability constraintto minimize makespan is considered. Each job has a release time. Jobs can be processed on the machine only after their release times. Pre- emption is not allowed. For the offline version, a 4/3-approximation algorithm and a dynamic programmingare provided, re- spectively. For the online version, an optimal online algorithm is presented.