期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一类安装时间和加工时间受资源约束的成组排序问题 被引量：1

Single Machine Group Scheduling Problem with Resource Constrains Setup and Processing Times
在线阅读 下载PDF
导出
摘要 讨论了安装时间和加工时间同时受资源约束的单机成组排序问题.目标函数为在满足最大完工时间限制条件下极小化安装时间消耗资源量与工件消耗资源量的总和.在讨论了问题若干性质基础上,给出了一个最优多项式算法,并用数值例子作了说明. In this paper, a single machine group scheduling problem with resource dependent setup and processing times is discussed. The objective function is to minimize total resource consumption of setup time and jobs under makespan constrains. Based on some properties of the problem, we also give an example to illustrate it.
作者 闫杨 赵传立
机构地区 沈阳师范大学数学与系统科学学院
出处 《沈阳师范大学学报（自然科学版）》 CAS 2006年第4期403-406,共4页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(10471096) 辽宁省教育厅科学研究基金项目(05L417)
关键词 单机排序 安装时间 资源约束 算法 single-machine scheduling setup time resource constrains algorithm
分类号 O223 [理学—运筹学与控制论]
  • 相关文献

参考文献7

  • 1CHENG T C E,JANIAK A.Resource optimal control in some single-machine scheduling problem[J].IEEE Trans Autom Control,1994,39(6):1243-1246.
  • 2JANIAK A.Time-optimal control in a single machine problem resource constrains[J].Automatica,1986,22(3):745-747.
  • 3JANIAK A.Single machine sequencing with linear models of jobs subject to precedence constrains[J].Archiwum Aut,i Telem,1988,33(2):203-210.
  • 4JANIAK A.Flow-shop scheduling with controllable operation processing times[A].In:Geering H P,Mansour M (eds).Large Scale Systems:Theory and Applications[C].Wroclaw Poland:Pergamon press,1986:602-605.
  • 5柏孟卓,唐恒永.任务到达时间依赖资源的单机排序问题[J].辽宁大学学报（自然科学版）,2001,28(4):313-317. 被引量：1
  • 6赵传立,唐恒永.一类资源约束单机排序问题[J].系统工程学报,2004,19(5):451-456. 被引量：12
  • 7JANIAK A,KOVALYOV M Y,MARIE-CLAUDE PORTMANN.Single machine group scheduling with resource dependent setup and processing times[J].European Journal of Operational Research,2005,162(1):112-121.

二级参考文献14

  • 1[1]A.Janiak, Single machine scheduling problem with a common deadline and resource dependent release dates, European J.Oper. Res[J], 1991,53:317-32 5.
  • 2[2]A.Janiak, Flow-shop scheduling with controllable operation processi ng times, in: H.P.Geering, M.Mansour(eds.), Large Scale Systems: Theory and Appl ications, Pergamon Press[M].1986,602-605.
  • 3[3]Jacek Blazewicz, Klaus Ecker, Günter Schmidt, Jan Weglarz, Scheduli ng in Computer and Manufacturing Systems, Springer-verlag Berlin Heidelberg[M ],1993,223-233.
  • 4Sundararaghavan P S, Kunnathur A S. Single machine scheduling with start time dependent processing times: Some solvable cases [J]. Eur. J. Oper. Res., 1994, 78(3): 394-403.
  • 5Garey M R, Johnson D S. Complexity results for multiprocessor scheduling under resource constraints[J]. SIAM J. Computing,1975, 4: 397-411.
  • 6Vickson R G. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine[J].Oper. Res., 1980, 28: 1155-1167.
  • 7Van Wassenhove L N, Baker K R. A bicriterion approach to time cost trade-offs in sequencing[J]. Eur. J. Oper. Res., 1982, 11(1): 48-54.
  • 8Cheng T C E, Janiak A. Resource optimal control in some single-machine scheduling problem[J]. IEEE Trans. Autom. Control,1994, 39: 1243-1246.
  • 9Janiak A. Time-optimal control in a single machine problem resource constraints[J]. Automatica, 1986, 22: 745-747.
  • 10Kononov A, Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines[J]. Journal of Operational Research Society, 2001, 52(6): 708-717.

共引文献11

同被引文献7

引证文献1

沈阳师范大学学报（自然科学版）
2006年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部