【摘要】 探讨了离散作业型 (Job shop)车间中的作业调度的分阶段模型 ,并根据离散作业调度的阶段性提出了基于作业状态空间的逐段式车间作业调度算法。通过对一个实际车间作业调度仿真比较 ,此算法运算速度比最短加工时间 (SPT)和最少工作量剩余 (LWR)算法快 ,其调度结果在实际作业车间具有可执行性。更多还原

【Abstract】 A job shop scheduling is the key to planning, management and optimization of manufacturing processes in modern manufacturing environment. This paper deals with a scheduling model and its procedure of job shop scheduling problems. The model of optimizing per phase based on a job status space for job shop scheduling is proposed, and the efficient heuristics algorithm for the model is presented. As an example, the algorithm is tested in an automated manufacturing system (a flexible manufacturing system). Experimental results show that the executive performance of the algorithm is better than shortest process time (SPT) and least work remained (LWR) and it can be applied to a job shop floor.更多还原