节点文献
两台机器若干作业问题的双向排序法
Bi directional Scheduling Algorithms for Some Two machine Shop Problems
【摘要】 研究两台机器若干作业的加工全长问题,首次引入双向排序法,对自由作业、单件作业、混合作业,以及三阶段工件的两机自由作业问题分别给出了新的算法,明显地简化了现有的处理方式。
【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.\;
【关键词】 时间表;
自由作业;
单件作业;
混合作业;
三阶段工件;
双向排序法;
【Key words】 scheduling; open shop; job shop; mixed shop; 3 stage job; bi directional scheduling algorithm;
【Key words】 scheduling; open shop; job shop; mixed shop; 3 stage job; bi directional scheduling algorithm;
【基金】 国家自然科学基金
- 【文献出处】 华东理工大学学报 ,JOURNAL OF EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY , 编辑部邮箱 ,1999年06期
- 【分类号】O224
- 【被引频次】4
- 【下载频次】83