首页 | 本学科首页   官方微博 | 高级检索  
     

有顺序约束的单件车间调度问题的逆序算法
引用本文:李琦,梁斌,王睿智,刘鸿雁. 有顺序约束的单件车间调度问题的逆序算法[J]. 鞍山科技大学学报, 2001, 24(6): 411-415
作者姓名:李琦  梁斌  王睿智  刘鸿雁
作者单位:鞍山钢铁学院电子与信息工程学院 辽宁鞍山114002(李琦),鞍钢机械制造公司灵山机械厂 辽宁鞍山114033(梁斌),鞍山钢铁学院计算机科学与工程学院 辽宁鞍山114002(王睿智),鞍山钢铁学院研究生部 辽宁鞍山114002(刘鸿雁)
摘    要:研究了部分工件在加工顺序上存在逻辑优选顺序约束的单件车间调度问题 .针对工件之间存在的加工顺序关系 ,构造了以交货期为基准 ,以寻求最长加工路径加工时间最短为目标的逆序算法 ,求解问题 .通过实例分析 ,说明了这一算法在工程中的可行性

关 键 词:顺序约束  单件车间  调度问题  目标函数  逆序算法
文章编号:1000-1654(2001)06-0411-05
修稿时间:2001-10-30

A Reverse Algorithm of Job-Shop Scheduling Problem Subject to Sequence Constraints
LI Qi ,LIANG Bin ,WANG Rui_zhi ,LIU Hong-yan. A Reverse Algorithm of Job-Shop Scheduling Problem Subject to Sequence Constraints[J]. Journal of Anshan University of Science and Technology, 2001, 24(6): 411-415
Authors:LI Qi   LIANG Bin   WANG Rui_zhi   LIU Hong-yan
Affiliation:LI Qi 1,LIANG Bin 2,WANG Rui_zhi 3,LIU Hong-yan 4
Abstract:Job_shop scheduling problem are studied in which there are the constraints of selecting sequences by logic priority in processing part of jobs.A reverse algorithm is formed which uses delivery date as base as well as the longest process way as the earliest arrangement target acconding to the process sequences which exist among the parts.The feasibility of this algonithm in projects is explained through an example.
Keywords:sequence constraint  job_shop  scheduling problem  objective function  reverse algorithm
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号