[1] Gawiejnowicz S. Time-dependent scheduling[M]. Berlin: Springer, 2008. [2] Biskup D. A state-of-the-art review on scheduling with learning effects[J]. European Journal of Operational Research, 2008, 188: 315-329. [3] 刘春来,王建军,赵传立.具有退化工件和工期窗口安排的排序问题[J].运筹与管理,2015,24(4):116-121. [4] 王杜娟,王建军,刘春来,王延章.具有恶化效应的新工件到达生产调度干扰管理[J].系统工程理论与实践,2015,35(2):368-380. [5] 刘颖,张新功.具有学习效应的三层供应链排序问题[J].运筹学学报,2016,20(1):31-42. [6] Gupta J N D, Gupta S K. Single facility scheduling with nonlinear processing times[J]. Computers & Industrial Engineering, 1988, 4: 387-393. [7] Kunnathur A S, Gupta S K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem[J]. European Journal of Operational Research, 1990, 1: 56-64. [8] Mosheiov G. Scheduling jobs with step-deterioration: minimizing makespan on a single-and multi-machine[J]. Computers and Industrial Engineering, 1995, 28: 869-879. [9] Yang S J. Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration[J]. Computers and Industrial Engineering, 2012, 62: 271-275. [10] Araghi M E, Jolai F, Rabiee M. Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach[J]. International Journal of Computer Integrated Manufacturing, 2014, 27: 733-746. [11] 刘鹏,周晓哗,荣楠.带有学习效应和恶化工件的双代理调度问题[J].系统工程学报,2012,27(6):841-846. [12] Low C Y, Lin W Y. Some scheduling problems with time-dependent learning effect and deteriorating jobs[J]. Applied Mathematical Modelling, 2013, 37: 8865-8875. [13] Janiak A, Krysiak T, Trela R. Scheduling problems with learning and ageing effects: a survey[J]. Decision Making in Manufacturing Services, 2011, 5: 19-36. [14] Rustogi K, Strusevich VA. Simple matching vs linear assignment in scheduling models with positional effects: a critical review[J]. European Journal of Operational Research 2012, 222: 393-407. [15] Nyman D, Levitt J. Maintenance planning, scheduling and coordination[M]. New York: Industrial Press, 2010. [16] Lodree Jr E J, Geiger C D. A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration[J]. European Journal of Operational Research, 2010, 201: 644-648. [17] Rustogi K, Strusevich V. Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance[J]. Journal of the Operational Research Society, 2014, 1-16. [18] Rustogi K, Strusevich V. Single machine scheduling with general positional deterioration and rate-modifying maintenance[J]. Omega, 2012, 40: 791-804. [19] Ji M, Hsu C J, Yang D L. Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration[J]. Journal of Combinatorial Optimization, 2013, 26: 437-447. [20] 刘春来,赵传立.工期窗口安排与具有退化效应和维修活动的单机排序[J].数学的实践与认识,2012,42(11):121-130. [21] Susan A. Order acceptance and scheduling: a taxonomy and review[J]. European Journal of Operational Research, 2011, 212: 1-11. [22] Cheng Y S, Sun S J. Scheduling linear deteriorating jobs with rejection on a single machine[J]. European Journal of Operational Research, 2009, 194: 18-27. [23] Li S S, Yuan J J. Parallel-machine scheduling with deteriorating jobs and rejection[J]. Theoretical Computer Science, 2010, 411: 3642-3650. [24] 高强,鲁习文.带有拒绝的单机和同型机排序问题[J].运筹学学报,2014,18(4):1-10. [25] 王磊,张玉忠,柏庆国.单机带有可拒绝的供应链排序问题[J].系统科学与数学,2014,34(9):1044-1050. [26] Gerstl E, Mosheiov G. Scheduling on parallel identical machines with job-rejection and position-dependent processing times[J]. Information Processing Letters, 2012, 112: 743-747. [27] Shabtay D, Gaspar N, Yedidsion L. A bicriteria approach to scheduling a single machine with job rejection and positional penalties[J]. Journal of Combinatorial Optimization, 2012, 23: 395-424. [28] Zhao C L, Yin Y Q, Cheng T C E, Wu C C. Single-machine scheduling and due date assignment with rejection and position-dependent processingtimes[J]. Journal of Industrial and Management Optimization, 2014, 10(3): 691-700. [29] Shabtay D, Gaspar N, Kaspi M. A survey on offline scheduling with rejection[J]. Journal of Scheduling, 2013, 16: 3-28. [30] Kovalyov M Y, Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs[J]. Journal of Heuristics, 1998, 3: 287-297. [31] Kovalyov M Y, Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem[J]. Operations Research, 1999, 47: 757-761. [32] Ji M, Cheng T C E. Parallel-machine scheduling with simple linear deterioration to minimize total completion time[J]. European Journal of Operational Research, 2008, 188: 342-347. [33] Ji M, Yang Q Y, Yao D L, Cheng T C E. Single-machine batch scheduling of linear deteriorating jobs[J]. Theoretical Computer Science, 2015, 580: 36-49. |