A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost
A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost
复制标题
具有批量交付成本的无界串行批量机上双智能体调度的进一步研究
DOI:
10.1016/j.cie.2017.07.029
复制
发表时间:
2017-09
影响因子:
7.9
通讯作者:
Yuan Jinjiang
中科院分区:
文献类型:
--
作者:
Qi Xianglai;Yuan Jinjiang
For the two-agent scheduling on an unbounded serial-batch machine with batch delivery cost, Yin et al. (2016) presented a comprehensive study, where the objective of each agent (AorB) is calculated by his scheduling cost plus his batch delivery cost proportional to the number of batches of this agent. Among their results, they provided a polynomial-time algorithm for minimizing the objective of agentAsubject to the constraint that the objective of agentBdoes not exceed a given threshold value, where the criterion of agentAis the total completion time plus batch delivery cost and the criterion of agentBis the maximum lateness plus batch delivery cost. We show in this paper that their algorithm is incorrect by a counterexample and the algorithm presented in Kovalyov et al. (2015) for solving the same problem without batch delivery cost can be used to solve the problem in Yin et al. (2016) in polynomial time. We further study two corresponding Pareto scheduling problems and provide polynomial-time algorithms.
登录
查看更多内容
影响因子:
2
作者:
Shisheng Li;Jinjiang Yuan
通讯作者:
Shisheng Li;Jinjiang Yuan
影响因子:
2
作者:
Baker, KR;Smith, JC
通讯作者:
Smith, JC
影响因子:
2
作者:
M. Kovalyov;A. Oulamara;A. Soukhal
通讯作者:
M. Kovalyov;A. Oulamara;A. Soukhal
DOI:
10.1016/j.ejor.2004.07.010
发表时间:
2005
期刊:
Eur. J. Oper. Res.
影响因子:
--
作者:
V. T’kindt;J. Billaut
通讯作者:
V. T’kindt;J. Billaut
DOI:
10.1016/j.ejor.2004.07.011
发表时间:
2005
期刊:
Eur. J. Oper. Res.
影响因子:
--
作者:
H. Hoogeveen
通讯作者:
H. Hoogeveen