期刊文献+

机器带准备时间的同类机分批排序算法 被引量:2

Batch Scheduling Algorithms for Similar Machines with Readiness Time
下载PDF
导出
摘要 讨论了两类机器带准备时间的同类机分批排序问题.对工件无到达时间及有常数个到达时间,目标函数为极小化加权总完工时间这两类问题进行研究,给出了两个最优算法,并对算法及其计算复杂性给予了分析与证明. This paper investigates sorting problems of two classes of similar machines with readiness time.For problems that have no or constant arrival times and which object functions are minimizing weighted completion time,we present the analysis and proof of two optimal algorithms and their complexities.
出处 《大学数学》 2011年第4期122-127,共6页 College Mathematics
关键词 分批排序 准备时间 FBLW算法 最优性 batch scheduling readiness time FBLW optimality
  • 相关文献

参考文献17

  • 1Uzsoy R, Lee C Y and Martin-Vega L A. A review of production planting and scheduling models in semiconductor industry, Part I: system characteristics, performance evaluation and production planning [J]. IIE Transaction, 1992, 24 (4):47-60.
  • 2Uzsoy R, Lee C Y and Martin-Vega L A. A review of production planting and scheduling models in semiconductor industry Part II: shop floor control [J].IIE Transaction on Scheduling and Logistics, 1994, 26(5): 44--55.
  • 3Zee D J, Vander A, Van Harten and Schuur P C. Dynamic job assignment heuristics for multi-server batch operations-A cost 6ased approach[J]. International Journal of Production Research, 1997,35 ( 11 ) : 3063-- 3093.
  • 4Zee D J, Vander A, Van Harten and Schuur P C. Online scheduling of multi-sever batch operations [J]. IIE Transactions, 2001,33(7): 569-586.
  • 5Mathirajan M and Sivakumar A I. Scheduling of batch processors in semiconductor manufacturing-a reviewERS. Symposium, National University of Sinngapore, Singapore MIT Alliance, January 2003.
  • 6Fanti M P, Maione B P , Iscitelli G and Turchiano B. Heuristic scheduling of johson a multi product hatch processing machine [J]. International Journal of Production Research, 34(8) :2163--2186.
  • 7Brucker P, Ladky G, Hoogeveveen A, Kovalyov H, Ports M Y, Tautenhahn C N T and Van de Velde S L. Scheduling a hatching machine [J].Journal of Scheduling, 1998,1 (1):31 -- 54.
  • 8Baptiste P. Batching identical jobs [J]. A mathematical Methods of Operations Research, 2000, 22(4) : 501--524.
  • 9Albers S and Brucker P. The complexity of one-machine batching problem[J].Discrete Applied mathematics, 1993,47(1): 87--107.
  • 10Potts C N and Lovalyov M Y. Scheduling with batching: a review [J].European Journal of Operational Research 2000,120(2) : 228--249.

二级参考文献17

  • 1苗翠霞,张玉忠.极小化加权总完工时间的分批排序问题[J].运筹学学报,2005,9(2):82-86. 被引量:19
  • 2Brucker P, Gladky A, Hoogevreen H, et al. VandeVele Scheduling a batching machine. Journal of Scheduling, 1998, 1: 31~54.
  • 3Chandru V, Lee C Y, Uzsoy R. Minimizing the totle completion time on batch processing machine. International Journal of Production Research, 1993, 31:2097~2121.
  • 4Deng X T, Zhang Y Z. Minimizing mean Response time in batch processing. Algorithmica,2004 (to appear).
  • 5Zhaohui Liu, Wenci Yu. Scheduling one batch processor subject to job release dates [ J ]. Discrete Applied Mathematics,2000, 105: 129~136.
  • 6Lee C, Uzsoy R, Martin Vega. Efficient algorithms for scheduling semiconductor burning operations [ J]. Operations Research, 1992, 40: 764~755.
  • 7Xiaotie Deng, Yuzhong Zhang. Miniming mean respose time inbatch progressing system [J]. Lecture Notes in Computer Science, 1999, 1627:231 ~ 240.
  • 8Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang. Approximation Algorithms in Batch Processing [J]. Journal of Combinatorial Optimization, 2003, 7:347 ~ 357.
  • 9Bruker P, Gladky A, Hoogeveen H, et al. Scheduling batchingmachine [J]. Journal of Scheduling, 1998, 1:31 ~ 54.
  • 10Lenstra, et al. Complexity of machine scheduling problems[J]. Annals of Discrete Mathematics, 1977, 1:343~ 362.

共引文献28

同被引文献71

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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