节点文献

两台机器若干作业问题的双向排序法

Bi directional Scheduling Algorithms for Some Two machine Shop Problems

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 俞文鮆刘朝晖

【Author】 YU Wen ci *, LIU Zhao hui (Department of Mathematics ECUST, Shanghai 20 O 237, China)$$$$

【机构】 华东理工大学数学系!上海200237

【摘要】 研究两台机器若干作业的加工全长问题,首次引入双向排序法,对自由作业、单件作业、混合作业,以及三阶段工件的两机自由作业问题分别给出了新的算法,明显地简化了现有的处理方式。

【Abstract】 In this paper,we propose a new approach to some two machine shop problems,which gives so called bi directional scheduling algorithms for these problems in terms of open shop,job shop,mixed shop and open shop with 3 stage jobs.The main idea of the new approach is that all operations of jobs are either scheduled forward successively from time zero,or scheduled backward successively from the time which is a lower bound of makespan.As the advantages fo our approach,constructions of the optimal schedules for these problems are greatly simplified,and the optimality proofs are simplified as well.\;

【基金】 国家自然科学基金
  • 【文献出处】 华东理工大学学报 ,JOURNAL OF EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY , 编辑部邮箱 ,1999年06期
  • 【分类号】O224
  • 【被引频次】4
  • 【下载频次】83
节点文献中: 

本文链接的文献网络图示:

本文的引文网络