PM  >> Vol. 7 No. 2 (March 2017)

    具有非线性安装时间和送出时间的单机排序问题
    Single-Machine Scheduling Problems with Non-Linear Past-Sequence-Dependent Setup Times and Delivery Times

  • 全文下载: PDF(561KB) HTML   XML   PP.61-67   DOI: 10.12677/PM.2017.72009  
  • 下载量: 322  浏览量: 1,378  

作者:  

李明泽:沈阳师范大学数学与系统科学学院,辽宁 沈阳

关键词:
排序学习效应恶化效应非线性安装时间送出时间Scheduling Learning Effect Deteriorating Effect Non-Linear Setup Times Delivery Times

摘要:

本文讨论了同时带有非线性安装时间和送出时间的单机排序问题。工件的实际加工时间为与其开始时间和位置有关的函数。工件的安装时间和送出时间均与工件的加工位置有关,还依赖于已加工完成工件的实际加工时间,即p-s-d形式。研究了关于最大完工时间、总完工时间、加权完工时间、总完工时间 次方之和以及最大延误时间的目标函数。分别给出上述问题的最优排序规则。

This paper studies the single machine scheduling problems with both non-linear setup times and delivery times where the actual processing time of a job is given as a function of its starting times and position in a sequence. The setup time and delivery time of a job are proportional to the jobs already processed and its scheduled position, that is, past-sequence-dependent (p-s-d). We consider the objective functions about the makespan, the total completion times, the total weighted completion times, the sum of the -th power of job completion times and the maximum tardiness. We give the optimal scheduling rules of the above problem respectively.

文章引用:
李明泽. 具有非线性安装时间和送出时间的单机排序问题[J]. 理论数学, 2017, 7(2): 61-67. https://doi.org/10.12677/PM.2017.72009

参考文献

[1] Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. (1999) A Review of Scheduling Research Involving Setup Consideration. Omega, 27, 219-239.
https://doi.org/10.1016/S0305-0483(98)00042-5
[2] Koulamas, C. and Kyparisis, G.J. (2008) Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times. European Journal of Operational Research, 187, 68-72.
https://doi.org/10.1016/j.ejor.2006.03.066
[3] Yeh, Y., Low, C.Y. and Lin, W.Y. (2015) Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup times. JAMP, 3, 10-15.
https://doi.org/10.4236/jamp.2015.31002
[4] Biskup, D. (1999) Single-Machine Scheduling with Learning Consideration. European Journal of Operational Research, 115, 173-178.
https://doi.org/10.1016/S0377-2217(98)00246-X
[5] Kuo, W.H. and Yang, D.L. (2007) Sin-gle-Machine Scheduling with Past-Sequence-Dependent Setup and Learning Effects. Information Processing Letters, 102, 22-26.
https://doi.org/10.1016/j.ipl.2006.11.002
[6] Wang, J.B. (2008) Single-Machine Scheduling with Past-Sequence-Dependent Setup Times and Time-Dependent Learning Effect. Computers & Industrial Engineering, 55, 584-591.
https://doi.org/10.1016/j.cie.2008.01.017
[7] Wang, J.B., Jiang, Y. and Wang, G. (2009) Sin-gle-Machine Scheduling with Past-Sequence-Dependent Setup Times and Effects of Deterioration and Learning. International Journal of Advanced Manufacturing Technology, 41, 1221- 1226.
https://doi.org/10.1007/s00170-008-1512-7
[8] Yang, D.L. and Kuo, W.H. (2010) Some Scheduling Problems with Deteriorating Jobs and Learning Effects. Computers & Industrial Engineering, 58, 25-28.
https://doi.org/10.1016/j.cie.2009.06.016
[9] Huang, X., Li, G., Huo, Y.Z. and Ji, P. (2013) Single Machine Scheduling with General Time-Dependent Deterioration, Position-Dependent Learning and Past-Sequence-Dependent Setup Times. Optimization Letters, 7, 1793-1804.
https://doi.org/10.1007/s11590-012-0522-4
[10] Lee, W.C. (2014) Single-Machine Scheduling with Past-Sequence-Dependent Setup Times and General Effects of Deterioration and Learning. Optimization Letters, 8, 135-144.
https://doi.org/10.1007/s11590-012-0481-9
[11] Cheng, T.C.E., Hsu, C.J., Huang, Y.C. and Lee, W.C. (2011) Single-Machine Scheduling with Deteriorating Jobs and Setup Times to Minimize the Maximum Tardiness. Computers & Operations Research, 38, 1760-1765.
https://doi.org/10.1016/j.cor.2010.11.014
[12] Koulamas, C. and Kyparisis, G.J. (2010) Single-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times. International Journal of Production Economics, 126, 264-266.
https://doi.org/10.1016/j.ijpe.2010.03.016
[13] Yang, S.J. and Yang, D.L. (2012) Single-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Position-Dependent Processing Times. Journal of the Operational Research Society, 63, 1508-1515.
https://doi.org/10.1057/jors.2011.155