基于截断学习效应的共同工期指派调度问题研究
Research on Common Due Date Assignment Scheduling Problem with Truncated Learning Effect
DOI: 10.12677/AAM.2020.93040, PDF,    科研立项经费支持
作者: 赵常霖, 吴 涛, 马宇豪, 张立强, 武建强, 王吉波:沈阳航空航天大学理学院,辽宁 沈阳
关键词: 调度学习效应共同工期指派Scheduling Learning Effect Common Due Date Assignment
摘要: 研究工件加工时间具有截断学习效应的单机调度问题,其中工件的加工时间与所排位置和截断因子都有关系。在共同工期指派下,目标是确定工件的加工顺序和共同工期使得工件的提前时间、延误时间、工期和总完工时间的线性加权和最小,其中提前时间和延误时间的权重为位置权重。证明了此问题是多项式时间可解的。
Abstract: This paper studies a single machine scheduling problem with truncated learning effect, where the actual processing time of a job depends on the position and truncation factor. Under the slack due date assignment, the objective is to determine the schedule of jobs and the common due date in order to minimize the linear weighted sum of the earliness, tardiness, common due date and total completion time, where the weights of the earliness and tardiness are positional weights. We prove that the problem can be solved in polynomial time.
文章引用:赵常霖, 吴涛, 马宇豪, 张立强, 武建强, 王吉波. 基于截断学习效应的共同工期指派调度问题研究[J]. 应用数学进展, 2020, 9(3): 341-345. https://doi.org/10.12677/AAM.2020.93040

参考文献

[1] Biskup, D. (2008) A State-of-the-Art Review on Scheduling with Learning Effects. European Journal of Operational Research, 188, 315-329. [Google Scholar] [CrossRef
[2] Azzouz, A., Ennigrou, M. and Said, L.B. (2018) Scheduling Problems under Learning Effects: Classification and Cartography. International Journal of Production Research, 56, 1642-1661. [Google Scholar] [CrossRef
[3] Cheng, T.C.E., Wu, C.-C., Chen, J.-C., Wu, W.-H. and Cheng, S.-R. (2013) Two-Machine Flowshop Scheduling with a Truncated Learning Function to Minimize the Makespan. International Journal of Production Economics, 141, 79-86. [Google Scholar] [CrossRef
[4] 王雪茹, 白雪莲, 王吉波, 殷娜. 基于截断学习效应的加权总完工时间流水作业排序问题研究[J]. 重庆师范大学学报, 2017, 34(5): 12-17.
[5] Wang, X.-R., Jin, J., Wang, J.-B. and Ji, P. (2014) Single Machine Scheduling with Truncated Job-Dependent Learning Effect. Optimization Letters, 8, 669-677. [Google Scholar] [CrossRef
[6] Wang, J.-B., Liu, F. and Wang, J.-J. (2019) Research on m-Machine Flow Shop Scheduling with Truncated Learning Effects. International Transactions in Operational Research, 26, 1135-1151. [Google Scholar] [CrossRef
[7] Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1979) Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5, 287-326. [Google Scholar] [CrossRef
[8] Brucker, P. (2001) Scheduling Algorithms. 3rd Edition, Springer, Berlin. [Google Scholar] [CrossRef
[9] Hardy, G.H., Littlewood, J.E. and Polya, G. (1934) Inequalities. Cambridge University Press, Cambridge.