摘要
本文利用优先规则同启发式方法相结合的方法确定工件在机床上的加工顺序。同时考察了静态和动态(随机)加工车间问题,并利用加工车间模拟方法使之更加切合实际情况。
The approach used in the present paper is to incorporate the heuristics into priority rules for the determination of the sequences of jobs on the machines. Both the static and dynamic problems are expounded theoretically. Simulation techniques necded for the understanding of dynamics inherent in the scheduling environment are introduced. Computational experiments in which various combined rules are ascertained and tested are also dealt with.
关键词
加工车间
进度计划
优先规则
Priority rule
Heuristics
Job shop
Scheduling
