文献类型：期刊文献

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

英文题名：Bi directional Scheduling Algorithms for Some Two machine Shop Problems

作者：俞文鮆[1];刘朝晖[1]

机构：[1]华东理工大学数学系,上海200237

年份：1999

卷号：25

期号：6

起止页码：629

中文期刊名：华东理工大学学报（自然科学版）

外文期刊名：Journal of East China University of Science and Technology

收录：CSTPCD;;国家哲学社会科学学术期刊数据库;Scopus;北大核心:【北大核心1996】；CSCD:【CSCD2011_2012】；

基金：国家自然科学基金

语种：中文

中文关键词：自由作业;单件作业;混合作业;双向排序法;排序

外文关键词：scheduling; open shop; job shop; mixed shop; 3 stage job; bi directional scheduling algorithm

摘要：研究两台机器若干作业的加工全长问题，首次引入双向排序法，对自由作业、单件作业、混合作业，以及三阶段工件的两机自由作业问题分别给出了新的算法，明显地简化了现有的处理方式。
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.\;