期刊文献+

排序问题1‖∑Ui最优解的唯一性及全部解的生成 被引量:2

THE UNIQUENESS CONDITION AND GENERATING ALL OPTIMAL SOLUTIONS FOR SCHEDULING PROBLEM 1||∑Ui
下载PDF
导出
摘要 本文研究经典排序问题——最小化误工工件数的单机排序问题.由于多指标决策问题的需要,希望确定出一个单指标问题的全部最优解的结构,这自然包括唯一性问题. This paper studies the single machine scheduling problem for minimizing the number of late jobs (1‖∑Ui) in the following aspects:(1) the condition of unique optimal solution;(2) the structure of the set of all optimal solutions;(3) an algorithm for generating all optimal solutions.
出处 《郑州大学学报(自然科学版)》 CAS 1997年第4期18-22,共5页 Journal of Zhengzhou University (Natural Science)
关键词 误工工件数 唯一性 全部解 排序 最优解 late jobs uniqueness all optimal solutions
  • 相关文献

参考文献1

  • 1越民义,韩继业.排序问题中的一些数学问题[J]数学的实践与认识,1976(03).

同被引文献24

  • 1孙叶平,唐万梅,唐国春.Moore-Hodgson算法最优性的新证明[J].重庆师范大学学报(自然科学版),2007,24(3):4-7. 被引量:12
  • 2Smith W E. Various optimizers for single-stage production[J]. Naval Research Logistics, 1956,3:59-66.
  • 3Moore J M. An n-job,one machine sequencing algorithm for minimizing the number of late jobs [J]. Management Science, 1968, 15 : 102-109.
  • 4Sidney J B. An extension of Moore' s due date algorithm[ M ]. Ehnaghraby S E. Symposium on the Theory of Scheduling and its Applications. Berlin : Springer, 1973 : 393-398.
  • 5Lawler E L. Sequencing to Minimize the Weighted Number of Tardy Jobs [ J ]. RAIRO, 1976,S10 (5) :27-33.
  • 6Kise H,Ibarakt T, Mine H. A solvable case of the one-machine scheduling problem with ready and due times [J]. Operations Research, 1978,26 : 121-126.
  • 7Pindo M. Scheduling : theory, algorithms, and systems [ M ]. 2nd edition. New Jersey : Prentice Hall,2002.
  • 8Brucker P. Scheduling algorithms [ M ]. 4th edition. Heidelberg:Springer,2004.
  • 9Emmons H. One-machine sequencing to minimize certain functions of job tardiness[J]. Opns Res, 1969,17:701-715.
  • 10Heck H, Roberts S. A note on extension of a result on scheduling with a secondary criteria [ J ]. Nay Res Log, 1972,19:403 405.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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