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

释放时间和工期同序的单机连续型批调度问题
引用本文:ZHAO Yu-Fang,唐立新.释放时间和工期同序的单机连续型批调度问题[J].自动化学报,2008,34(8):957-963.
作者姓名:ZHAO Yu-Fang  唐立新
作者单位:1.沈阳师范大学数学与系统科学学院 沈阳 110034
基金项目:国家杰出青年科学基金 , 国家高技术研究发展计划(863计划) , 国家自然科学基金
摘    要:本文研究的连续型批处理机调度问题, 是在钢铁工业管坯的加热过程中提出来的. 工件带有释放时间和工期, 工件进入和离开机器是按周期依次进行的. 本文针对单机连续型批调度问题中工件释放时间和工期同序的情况, 分析了极小化最大拖期和拖期工件数等问题的计算复杂性, 证明了两类问题都是强NP-难的. 对于工件的释放时间和加工时间、工期都同序的特殊情况, 分别给出了能够获得对应问题的最优解的多项式算法.

关 键 词:加热炉调度    连续批    计算复杂性    动态规划算法
收稿时间:2007-3-27
修稿时间:2007-11-14

Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine
ZHAO Yu-Fang,TANG Li-Xin.Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine[J].Acta Automatica Sinica,2008,34(8):957-963.
Authors:ZHAO Yu-Fang  TANG Li-Xin
Affiliation:1.School of Mathematics and Systems Science, Shenyang Normal University, Shenyang 110034;2.Logistics Institute, Northeastern University, Shenyang 110004
Abstract:We consider the problem of continuous batch scheduling arisen from the heating-process of blooms in the steel industry,where each job has release time and a due date,each heating furnace is modeled as continuous batch processing machine and the jobs in the same batch enter and leave the machine in periods.In this paper,the jobs release time and due dates are assumed to be agreeable.We consider two different objective functions:minimize the maximum tardiness and minimize the number of tardy jobs.We study the complexity of the problems and prove that both of them are NP-hard in the strong sense.We also provide optimal algorithms with polynomial running times for the case where the jobs release time,due dates,and processing time are agreeable,respectively.
Keywords:Heating-furnace scheduling  continuous batch  computational complexity  dynamic programming algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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