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

Performance analysis of active schedules in identical parallel machine 被引量：2

Performance analysis of active schedules in identical parallel machine
下载PDF
导出
摘要 Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs＇ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem. Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs＇ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.
作者 Changjun WANG Yugeng XI
机构地区 Institute of Automation
出处 《控制理论与应用（英文版）》 EI 2007年第3期239-243,共5页
基金 This work was supported by the National Natural Science Foundation of China (No. 60474002, 60504026) Shanghai Development Foundation forScience and Technology (No. 04DZ11008)
关键词 SCHEDULING Identical parallel machine Active schedule Performance analysis Scheduling Identical parallel machine Active schedule Performance analysis
分类号 O22 [理学—运筹学与控制论]
  • 相关文献

参考文献7

  • 1R. Bellman,,A. O. Esogbue,I. Nabeshima.Mathematical Aspects of Scheduling and Applications[]..1982
  • 2A. H. G. Kan Rinnooy.Machine Scheduling Problems: Classi?cation, Complexity and Computations[]..1976
  • 3J. Riezebos,,G. J. C. Gaalman.Time lag size in multiple operations ?ow shop scheduling heuristics[].European Journal of Operational Research.1998
  • 4C. Chekuri,S. Khanna.Approximation algorithms for minimizing average weighted completion time[].Handbook of Scheduling: Algorithms Models and Performance Analysis.2004
  • 5L. A. Hall,A. S. Schulz,D. B. Shmoys, et al.Scheduling to minimize average completion time: off-line and online approximationalgorithms[].Mathematics of Operations Research.1997
  • 6Wang Changjun Xi Yugeng.Rolling optimization algorithm based on collision window for single machine scheduling problem[J].Journal of Systems Engineering and Electronics,2005,16(4):816-822. 被引量：4
  • 7Fleszar K,Hindi K S.Solving the resource-constrained project scheduling problem by a variable neighbourhood search[].European Journal of Operational Research.2004

二级参考文献9

  • 1Chandra R. On n |1|F dynamic deterministic problems.Naval Research Logistics., 1979, 26:537-544.
  • 2Desscalky M I, Deogun J S. Sequencing jobs with unequal ready times to minimize mean flow time. SIAM J. Computing, 1981, 10(1) :192-202.
  • 3Hoogeveen J A, Vestjem A P A. Optimal on-line algorithms for single-machine scheduling. Proceedings of the Fifth International IPCD Conference, Berlin , 1996. 404-414.
  • 4Chu C. Efficient heuristics to minimize total flow time with release dates. Operations Research Letter, 1992,12:321-330.
  • 5Chand S, Traub R, Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with rdease dates. Annals of Operations Research, 1997, 70:115-125.
  • 6Uzsoy R, Ovacik I M. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research, 1994, 32(6): 1243-1263.
  • 7Fan Jian, Xi Yugeng. A rolling horizon job shop rescheduling strategy in the dynamic environment. Int.J. of Advanced Manufacturing Technology, 1997, 13(3) :227-232.
  • 8Giffler B, Thompson G L. Algorithms for solving production-scheduling problems. Operations Research, 1960, 8(4) : 487-503.
  • 9Hariri A M A, Potts C N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics,1983 (5):99-109.

共引文献3

同被引文献12

  • 1熊禾根,李建军,孔建益,杨金堂,蒋国璋.考虑工序相关性的动态Job shop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55. 被引量：33
  • 2Pinedo.调度:原理、算法和系统[M].第2版.北京:清华大学出版社,2005.
  • 3Sgall J. On-line scheduling, online algorithms: The state of the art[J]. Lecture Notes in Computer Science,1998, 1442(5): 196-231.
  • 4Tang L, Liu J, Rong A, et al. An effective heuristic algorithm to minimise stack shufles in selecting steel slabs from the slab yard for heating and rolling[J]. J of the Operational Research Society, 2001, 52(10): 1091- 1097.
  • 5Tang L X, Liu J Y, Rong A Y, et al. A review of planning and scheduling systems and methods for integrated steel production[J]. European J of Operational Research, 2001, 133(3): 1-20.
  • 6Lixin Tang, Jiyin Liu, Aiying Rong, et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan iron & steel complex [J]. European J of Operational Research, 2000, 124 (2): 267-282.
  • 7Graham R. Bounds for certain multiprocessing anomalies [J]. Bell System Technology Journal, 1966, 45 (2): 1563-1581.
  • 8Potts C N, Kovalyov M Y. Scheduling with batching: A review[J]. European J of Operational Research, 2000, 120(3) : 228-249.
  • 9Mikhail A Kubzin, Vitaly A Strusevich. Two-machine flow shop no-wait scheduling with a nonavailability interval[J]. Naval Research Logistics, 2004, 51 (4): 613-632.
  • 10Celia A Glass, Hans Kellerer. Parallel machine scheduling with job assignment restrietions[J]. Naval Research Logistics, 2007, 54(10): 250-258.

引证文献2

二级引证文献4

控制理论与应用（英文版）
2007年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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