m×n同序加工的生产周期算法被引量：1

下载PDF

导出

摘要当一组零件在一系列设备上加工顺序确定下来后，现有的计算加工周期的方法比较繁杂。本文给出一种简便算法，可以显著地减少计算时间。

作者郭立夫陆晓芳

机构地区吉林工业大学管理学院

出处《中国管理科学》 CSSCI 1995年第3期20-25,共6页 Chinese Journal of Management Science

关键词排序生产周期同序加工算法

参考文献1

1Alidaee B,Womer N K.Scheduling with time dependent processing times:review and extensions[J].Journal of the Operational Research Society,1999,50:711-720.
2Mosheiov G.V-shaped policies for scheduling deteriorating jobs[J].Operations Research,1991,39:979-991.
3Sundararaghavan P S,Kunnathur A S.Single machine scheduling with start time dependent processing times:some solvable cases[J].European Journal of Operational Research,1994,78:394-403.
4Browne S,Yechiali U.Scheduling deteriorating jobs on a single processor[J].Operations Research,1990,38:495-498.
5Mosheiov G.Scheduling jobs under simple linear deterioration[J].Computers and Operations Research,1994,21:653-659.
6Mosheiov G.Complexity analysis of job-shop scheduling with deteriorating jobs[J].Discrete Applied Mathematics,2002,117:195-209.
7Lawler E L.Sequencing jobs to minimize total weighted completion time subject to precedence constraints[J].Annals of Discrete Mathematics,1978,2:75-90.
8Sidney J B.Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs[J].Operations Research,23:283-298.
9Wang J.-B.Xia Z.-Q.Scheduling jobs under dereasing linear deterioration[J].Information Processing Letters,2005,94:63-69.
10Wang J.-B.Xia Z.-Q.No-wait or no-idle permutation flowshop scheduling with dominating machines[J].Journal of Applied Mathematics and Computing,2005,17:419-432.

中国管理科学

1995年第3期

内容加载中请稍等...