摘要
研究了具有柔性加工路径的ＪｏｂＳｈｏｐ静态调度问题，并考虑了与操作序列有关的工件安装时间和工件到期时间的约束．提出了一种将遗传算法和分派规则相结合的调度算法，用遗传算法决定各工件的每个操作应分配到哪台机器上加工，而对每台机器则运用分派规则来决定相应工件在此机器上加工的次序和开始加工时间，遗传算法中的进化机理使得该算法有可能得到最优调度结果．
The static job shop scheduling problem with sequence dependent setup time and due date constraints is studied.A hybrid scheduling strategy which combines the genetic algorithm with the dispatching rules is proposed.The genetic algorithm is adopted to decide on which machine each operation of the jobs should be processed,while the dispatching rules are used to arrange the working sequence of each machine so that the process order and the release time of jobs on each machine can be determined .The evoluationary mechanism in the genetic algorithm makes it possible to get the optimal schedule result.Finally an example is presented to illustrate the efficiency of the algorithm.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1997年第3期49-52,共4页
Journal of Shanghai Jiaotong University
基金
上海市自然科学基金
