摘要
生产调度问题,一般可根据生产流程的不同分为Job-shop调度和Flowshop调度两大类(也有学者认为,存在两者相结合的第三类—混合调度)。该文研究以最小化Makespan为目标的Flowshop调度问题。基于Agent理论,提出采用Flowshop复合代理体(Flowshop-Compound-Agent,FSCA)求解Flowshop调度问题的方法。在给出FSCA的结构及其实现的基础上,通过毛纺企业制条车间的实例说明了使用FSCA解决Flowshop调度问题的有效性。
Production scheduling problem can be classified to two kinds, job-shop production scheduling and flowshop production scheduling according to the production procedure. This paper presents a flowshop compound-agent (FSCA) applied to solve the flowshop scheduling problem with the objective of minimizing Makespan. The concept of compound-agent is provided. The FSCA architecture, function and realization are studied. The detail of solving the production scheduling problem using FSCA and its result are shown througha factual strip workshop of wool textile mill, also it shows the usability of FSCA. ;;
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第9期204-206,237,共4页
Computer Engineering