摘要
讨论了生产管理中将n个零件安排给m台机器加工的一类排序问题。取消了m≤n的限制 ,允许机器空闲并引入负荷 (最大加工零件数 )的思想 ,得出了此类排序问题的扩展模型以及通用求解算法。
A discussion of the job scheduling problem of assigning n parts to be processed to m machines is made. With machines allowed to be idle and a idea of load introduced, where load means the maximum of parts processed by each machine, an extended model and a generalized algorithm are obtained without the constraint of m≤n. The results of an example prove the effectiveness of the model and algorithm proposed in this paper.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2002年第4期459-462,共4页
Journal of Southwest Jiaotong University
基金
国家自然科学基金资助项目 (6 9874 0 33)