中文摘要：

区间作业车间调度问题近年来已成为生产调度研究的热点，现有研究工作主要集中于问题描述和优化求解方面，在理论模型、动态性质等方面还缺乏实质性成果．使用时间Petri网模型建模区间作业车间调度问题，并运用状态类可达性分析方法，分析模型所有可行调度，进而求解具有最小下界和最小上界的优化调度，为区间作业车间调度问题的建模与分析提供有益参考．

英文摘要：

Interval job-shop scheduling problem is a new research hotspot in work-shop scheduling. The existing research work focused on problem description and optimization, but substantial results is lacking on theoretical model and dynamic properties. We present a time Petri net to model interval job-shop scheduling problems, and uses a reachability method based on state classes to analyze all feasible schedules of this model, and then solves optimal schedules with least upper bound and least lower bound. The proposed method can provide a helpful reference for modelling and analyzing interval job-shop scheduling problems.