arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.04253math.OCcs.AIcs.LG
收藏

集成离线与在线学习以求解一大类调度问题

Integrated Offline and Online Learning to Solve a Large Class of Scheduling Problems

Tsinghua University(清华大学);University of Maryland(马里兰大学);Peking University(北京大学)

Anbang Liu, Zhi-Long Chen, Jinyang Jiang, Xi Chen

AI总结:

本文提出统一机器学习框架,利用时间索引形式、特殊实例离线训练与在线单实例微调,求解含释放时间等一大类单机最小和调度问题。

摘要:

本文开发了一种统一的机器学习(ML)方法,用于预测具有非递减最小和目标函数的单机调度问题的高质量解,这些问题可能包含也可能不包含释放时间。我们的ML方法在三个主要方面具有新颖性。首先,该方法是针对上述整类问题开发的。为实现这一点,我们利用了所考虑的整类问题都能以统一方式表述为时间索引形式这一事实。我们开发了一个深度神经网络(DNN),该网络使用时间索引形式中的成本参数作为输入,以有效预测该形式的连续解,并据此轻松构造可行的离散解。其次,该方法的新颖之处在于DNN模型的训练方式。鉴于这些问题具有NP难性质,训练所需的标签(即最优解)难以生成。为克服这一困难,我们生成并利用一组特殊实例对ML模型进行离线训练,这些实例只需极少计算量即可找到最优解。第三,我们在方法中采用的新颖思想是,开发了一种在线单实例学习方法,针对给定在线实例微调DNN中的参数,目标是为该给定实例生成改进的解。为此,我们开发了一个可行性代理,将给定实例的目标值近似为DNN输出的连续函数,从而使我们能够推导梯度并更新DNN中的可学习参数。数值结果表明,我们的方法能够高效地为多达1000个作业的多种单机调度最小和问题生成高质量解。

英文摘要:

In this paper, we develop a unified machine learning (ML) approach to predict high-quality solutions for single-machine scheduling problems with a non-decreasing min-sum objective function with or without release times. Our ML approach is novel in three major aspects. First, our approach is developed for the entire class of the aforementioned problems. To achieve this, we exploit the fact that the entire class of the problems considered can be formulated as a time-indexed formulation in a unified manner. We develop a deep neural network (DNN) which uses the cost parameters in the time-indexed formulation as the inputs to effectively predict a continuous solution to this formulation, based on which a feasible discrete solution is easily constructed. The second novel aspect of our approach lies in how the DNN model is trained. In view of the NP-hard nature of the problems, labels (i.e., optimal solutions) are hard to generate for training. To overcome this difficulty, we generate and utilize a set of special instances, for which optimal solutions can be found with little computational effort, to train the ML model offline. The third novel idea we employ in our approach is that we develop an online single-instance learning approach to fine tune the parameters in the DNN for a given online instance, with the goal of generating an improved solution for the given instance. To this end, we develop a feasibility surrogate that approximates the objective value of a given instance as a continuous function of the outputs of the DNN, which then enables us to derive gradients and update the learnable parameters in the DNN. Numerical results show that our approach can efficiently generate high-quality solutions for a variety of single-machine scheduling min-sum problems with up to 1000 jobs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑