期刊文献+

工件带有温降的生产与前运输协调调度问题 被引量:3

Inbound transportation and production coordinated scheduling problem with temperature reduction jobs
下载PDF
导出
摘要 研究单机环境下生产与生产前运输的协调调度问题,目标函数是最大完成时间最小化.具有热状态的工件等待加工时温度降低会导致处理时间的增加,从而假设具有热状态工件的实际处理时间为等待时间与初始处理时间之和,温度无变化工件的处理时间不变.对于车辆数为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
  • 相关文献

参考文献9

  • 1Maggu P L, Das G, Kumar R. On equivalent job-for-job block in 2 x n sequencing problem with transportation times [ J ]. Journal of the Operations Research Society of Japan, 1981, 2d: 136-1d6.
  • 2Maggu P L, Singhal M L, Mohammad N, et al. On n-job, 2-machine flow-shop scheduling problem with arbitrary time lags and transportation times of jobs[J]. Journal of the Operations Research Society of Japan, 1982, 25: 219-227.
  • 3Lee C Y, Chen Z L. Machine scheduling with transportation considerations [ J ]. Journal of Scheduling, 2001, 4 ( 1 ) : 3-24.
  • 4Wang G Q, Cheng T C E. Parallel machine scheduling with batch delivery costs [ J ]. International Journal of Production Economics, 2000, 68(2) : 177-183.
  • 5Brucker P, Knust S, Cheng T C E, et al. Complexity results for flow-shop and open-shop scheduling problems with transportation delays[J]. Annals of Operations Research, 2004, 129( 1 ) : 81-106.
  • 6Chang Y C, Lee C Y. Machine scheduling with job delivery coordination [ J ]. European Journal of Operational Research, 2004, 158(2) : 470-487.
  • 7Sriskandarajah C, Goyal S K. Scheduling of a two-machine flowshop with processing time linearly dependent on job waiting-time [ J ]. Journal of the Operational Research Society, 1989, 40 (10) : 907-921.
  • 8Graham R L, Lawler E L, Lenstra J K, et al. Optimization and approximation in deterministic sequencing and scheduling theory: A survey[J]. Annals of Discrete Mathematics, 1979, 5(2) : 287-326.
  • 9Johnson S M. Optimal two- and three-stage production schedules with setup times included [ J ]. Naval Research Logistics Quarterly, 1954, 1 ( 1 ) : 61-68.

同被引文献32

  • 1关静,唐立新.钢铁企业生产与运输费用协调调度问题[J].东北大学学报(自然科学版),2006,27(2):150-152. 被引量:2
  • 2Agnetis A, Mirchandani P B, Pacciarelli D, et al. Scheduling problems with two competing agents[J]. Operations Research, 2004, 52 (2): 229 - 242.
  • 3Baker K R, Smith J C. A multiple-criterion model for machine scheduling[J]. Journal of Scheduling, 2003, 6 (1): 7 - 16.
  • 4Cheng T C E, Ng C T, Yuan J J. Multi-agent scheduling on a single machine with max-form criteria[J]. European Journal of Opera- tional Research, 2008, 188 (2): 603 - 609.
  • 5Agnetis A, Pascale G, Pacciarelli D. A Lagrangian approach to single-machine scheduling problems with two competing agents[J]. Journal of Scheduling, 2009, 12 (4): 401 - 415.
  • 6Liu P, Tang L X, Zhou X Y. Two-agent group scheduling with deteriorating jobs on a single machine[J]. International Journal of Advanced Manufacturing Technology, 2010, 47 (5/8): 657 - 664.
  • 7Ng C T, Cheng T C E, Bachman A, et al. Three scheduling problems with deteriorating jobs to minimize the total completion time[J]. Information Processing Letters, 200-2, 81 (6): 327 - 333.
  • 8Ho K I J, Leung J Y T, Wei W D. Complexity of scheduling tasks with time-dependent execution times[J]. Information Processing Letters, 1993, 48 (6): 315- 320.
  • 9Wang J B, Liu L L. Two-machinb flowshop scheduling with linear decreasing job deterioration[J]. Computers and Industrial Engineering, 2009, 56 (4): 1487 - 1493.
  • 10Wang J B. A note on single-machine scheduling with decreasing time-dependent job processing times[J]. Applied Mathematical Modelling, 2010, 34 (2): 294 - 300.

引证文献3

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部