Inverse scheduling with maximum lateness objective
Inverse scheduling with maximum lateness objective
复制标题
DOI：
10.1007/s10951-009-0117-9
复制
发表时间：
2009-10
影响因子：
2
通讯作者：
P. Brucker;N. V. Shakhlevich
中科院分区：
文献类型：
--
作者：
P. Brucker;N. V. Shakhlevich
研究了在逆优化的背景下出现的具有最大延迟准则的单机调度问题的一系列对应问题。在正向调度问题中，所有参数都是给定的，目标是找到最大延迟值最小的最优作业序列，而在逆向调度问题中，加工时间或到期日的确切值是未知的，必须确定它们，以便预先指定的解成为最优解。我们在不同类型的规范下对相应的逆模型进行了相当完整的分类，这些规范测量了调整后参数与给定估计的偏差。
We study a range of counterparts of the single-machine scheduling problem with the maximum lateness criterion that arise in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find the optimal job sequence for which the value of the maximum lateness is minimum, in inverse scheduling the exact values of processing times or due dates are unknown, and they should be determined so that a prespecified solution becomes optimal. We perform a fairly complete classification of the corresponding inverse models under different types of norms that measure the deviation of adjusted parameters from their given estimates.