LEE C Y, UZSOY R, MARTIN-VEGA L A. Efficient Algorithms for Scheduling Semiconductor Burn-in Operations[J]. Operations Research, 1992, 40(4): 764-775. doi: 10.1287/opre.40.4.764
ALLAHVERDI A, NG C T, CHENG T C E, et al. A Survey of Scheduling Problems with Setup Times or Costs[J]. European Journal of Operational Research, 2008, 187(3): 985-1032. doi: 10.1016/j.ejor.2006.06.060
ALLAHVERDI A. The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs[J]. European Journal of Operational Research, 2015, 246(2): 345-378. doi: 10.1016/j.ejor.2015.04.004
ZHANG E, LIU M, ZHENG F F, et al. Single Machine Lot Scheduling to Minimize the Total Weighted (Discounted) Completion Time[J]. Information Processing Letters, 2019, 142: 46-51. doi: 10.1016/j.ipl.2018.10.002
HOU Y T, YANG D L, KUO W H. Lot Scheduling on a Single Machine[J]. Information Processing Letters, 2014, 114(12): 718-722. doi: 10.1016/j.ipl.2014.06.016
YANG D L, HOU Y T, KUO W H. A Note on a Single-Machine Lot Scheduling Problem with Indivisible Orders[J]. Computers & Operations Research, 2017, 79: 34-38.
BAKER K R, COLE SMITH J. A Multiple-Criterion Model for Machine Scheduling[J]. Journal of Scheduling, 2003, 6(1): 7-16. doi: 10.1023/A:1022231419049
AGNETIS A, MIRCHANDANI P B, PACCIARELLI D, et al. Scheduling Problems with Two Competing Agents[J]. Operations Research, 2004, 52(2): 229-242. doi: 10.1287/opre.1030.0092
AGNETIS A, BILLAUT J C, GAWIEJNOWICZ S, et al. Multiagent Scheduling[M]. Berlin: Springer, 2014.
YUAN J J, NG C T, CHENG T C E. Scheduling with Release Dates and Preemption to Minimize Multiple Max-Form Objective Functions[J]. European Journal of Operational Research, 2020, 280(3): 860-875. doi: 10.1016/j.ejor.2019.07.072
ZHANG X G, WANG Y. Two-Agent Scheduling Problems on a Single-Machine to Minimize the Total Weighted Late Work[J]. Journal of Combinatorial Optimization, 2017, 33(3): 945-955. doi: 10.1007/s10878-016-0017-9
ZHANG Y, YUAN J J. A Note on a Two-Agent Scheduling Problem Related to the Total Weighted Late Work[J]. Journal of Combinatorial Optimization, 2019, 37(3): 989-999. doi: 10.1007/s10878-018-0337-z
LI S S, YUAN J J. Single-Machine Scheduling with Multi-Agents to Minimize Total Weighted Late Work[J]. Journal of Scheduling, 2020, 23(4): 497-512. doi: 10.1007/s10951-020-00646-7
王申重, 张新功. 基于截断学习效应和时间相关的供应链排序问题[J]. 西南大学学报(自然科学版), 2020, 42(1): 44-50.
王申重. 基于一般时间相关和位置相关的单机排序问题研究[J]. 重庆师范大学学报(自然科学版), 2017, 34(2): 6-10.
白静, 刘璐, 王吉波. 具有截断学习效应和工件带准备时间的单机排序问题[J]. 运筹与管理, 2014, 23(6): 152-156. doi: 10.3969/j.issn.1007-3221.2014.06.021
GAREY M R, JOHNSON D S. Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. SIAM Review, 1982, 24(1): 90-91.