摘要
研究单机环境下生产与生产前运输的协调调度问题,目标函数是最大完成时间最小化.具有热状态的工件等待加工时温度降低会导致处理时间的增加,从而假设具有热状态工件的实际处理时间为等待时间与初始处理时间之和,温度无变化工件的处理时间不变.对于车辆数为1,被调度工件均温度不变化问题,给出最优算法;证明了车辆数为1,同时存在热状态工件和温度不变化工件的调度问题和车辆数为2,同时存在热状态工件的调度问题是强NP困难问题.
We deal with a single machine coordinated scheduling problem between production and inbound transportation. The objective is to minimize the maximum completion time. Since the heat loss caused by waiting before processing may increase the processing time, we assume that the actual processing time for the temperature reduction job is the sum function of waiting time and its original processing time. The processing time for job without temperature reduction keeps constant. An optimal algorithm is provided for the problem with one vehicle and jobs without temperature reduction. It is proved that the problems with both temperature reduction jobs and without temperature reduction jobs are strongly NP-hard, in which the number of vehicle is one. We also prove the problems with two vehicles and some temperature reduction jobs are strongly NP-hard.
出处
《系统工程学报》
CSCD
北大核心
2007年第6期639-643,共5页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(60674084)
国家杰出青年科学基金资助项目(70425003)
国家863高技术研究发展计划资助项目(2006AA04Z174)
关键词
调度
运输
协调
温降
优化
scheduling
transportation
coordination
temperature reduction
optimization