期刊文献+

现代排序论应用 被引量:5

Modern scheduling and its applications
下载PDF
导出
摘要 排序是为加工若干个工件而对工件及其所需要的机器按时间进行分配和安排,在完成所有工件加工时使得某个(些)目标为最优。在过去几十年里,排序论的研究进展迅速。简述排序论在中国的发展历程,介绍现代排序论在三个代表性领域的应用:供应链排序、半导体生产中的排序和手术排程,并展望未来的发展。 Scheduling is the allocation of machines according to time in order to process the collection of jobs. It is a decision-making with the goals of optimizing one or more objectives. In the past decades, the study of scheduling has been advanced quickly. This article presentd a brief history and the recent developments of modern scheduling theory in China. Then, the applications in three focuses are prospected, namely supply chain, semiconductor manufacturing and surgical operation. A future perspective is provided at the end of the article.
出处 《自然杂志》 2015年第2期115-120,共6页 Chinese Journal of Nature
基金 国家自然科学基金资助项目(71371120) 天津市高等学校人文社会科学研究项目(20132144)资助
关键词 排序 供应链 半导体/晶圆 手术 scheduling, supply chain, semiconductor/wafer, surgical operation
  • 相关文献

参考文献19

  • 1越民义,韩继业.n个零件在m台机床上的加工顺序问题(I)[J].屮闺科学,1975,5:462-470.
  • 2唐国春.关于Scheduling中文译名的注记[J].系统管理学报,2010,19(6):713-716. 被引量:5
  • 3唐国春.一万米高空是晴天——教坛漫笔[M].珠海:珠海出版社,2011.
  • 4国家自然科学基金委员会.国家自然科学基金申请代码[EB/OL][2014-7-20]. http://www.nsfc.gov.cn/nsfc/cen/xmzn/2014xmzn/17.
  • 5BAKER K R. Introduction to Sequencing and Scheduling [M]. NewYork: John Wiley & Sons, 1974.
  • 6PINEDO M L. Scheduling: theory, algorithms, and systems [M]. 3rdEdition. New York: Springer, 2008.
  • 7BRUCKER P, KNUST S. Complexity results for schedulingproblems [EB/OL]. (2009-6-29)[2014-7-20]. http://www.informatik.uni-osnabrueck.de/knust/class.
  • 8POTTS C N, STRUSEVICH V A. Fifty years of scheduling: a surveyof milestones [J]. Journal of the Operational Research Society, 2009,60:S41-S68.
  • 9LAWLER E L, LENSTRA J K, RINNOOY KAN A H G, et al.Sequencing and scheduling: Algorithms and complexity [M]//GRAVESS C, et al. Handbooks in OR & MS(Volume 4). Amsterdam: ElsevierScience Publishers B V, 1993: 445-522.
  • 10唐国春.供应链排序的模型和方法[C]〃袁亚湘,等,中国运筹学会第八届学术交流会论文集.香港:Globa丨-Link Informatics Limited,2006: 495-502.

二级参考文献13

  • 1越民义,韩继业.n个零件在m台机床上的加工顺序问题(I).中国科学,1975,.
  • 2Potts C N,Strusevich V A.Fifty years of scheduling:a survey of mi lestones[J].Journal of the Operational Research Society,2009 (60):S41-S 68.
  • 3Baker K R.Introduction to Sequencing and Scheduling[M].New York:J ohn Wiley & Sons,1974.
  • 4Pinedo M.Scheduling:Theory,Algorithms,and Systems[M].New Prent ice Hall,Englewood Cliffs,Jersey:07632,2002.张智海译,北京:清华大学出版社.2007.
  • 5Kumar P.R. Re-entrant lines[J]. Queueing Systems, 1993, 13(1-2): 87-110.
  • 6Pan J.C., Chen J.S. Minimizing makespan in re-entrant permutation flow-shops[J]. Journal of the Operational Research Society, 2003, 54: 642-653.
  • 7Choi S.W., Kim Y.D. Minimizing makespan on an m-machine re-entrant flow shop[J]. Computers and Operations Research., 2008, 35: 1684-1696.
  • 8Chen J.S., Pan J.Ch., Wu C.K. Hybrid tabu search for re-entrant permutation flow-shop scheduling problem[J]. Expert Systems with Applications, 2008, 34: 1924-1930.
  • 9Baker K.R. Introduction to Sequencing and Scheduling[M]. Wiley, New York, 1974.
  • 10Pinedo M.L. Scheduling: Theory, Algorithms and Systems[M]. Englewood Cliffs, N J: Prentice- Hall, 2002, 35-39.

共引文献5

同被引文献40

引证文献5

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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