期刊
IEEE ACCESS
卷 10, 期 -, 页码 99541-99552出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2022.3207559
关键词
Supervised learning; Metaheuristics; Job shop scheduling; Deep learning; Recurrent neural networks; Machine learning; Deep learning; job shop scheduling; metaheuristic; recurrent neural network; scheduling
In recent years, the optimization community has shown increasing interest in leveraging Machine Learning (ML) to enhance algorithm design. Research focusing on using ML to predict the quality of machine permutations has led to improvements in the performance of algorithms like Tabu Search, showcasing the value of such predictive modeling techniques.
In recent years, the power demonstrated by Machine Learning (ML) has increasingly attracted the interest of the optimization community that is starting to leverage ML for enhancing and automating the design of algorithms. One combinatorial optimization problem recently tackled with ML is the Job Shop scheduling Problem (JSP). Most of the works on the JSP using ML focus on Deep Reinforcement Learning (DRL), and only a few of them leverage supervised learning techniques. The recurrent reasons for avoiding supervised learning seem to be the difficulty in casting the right learning task, i.e., what is meaningful to predict, and how to obtain labels. Therefore, we first propose a novel supervised learning task that aims at predicting the quality of machine permutations. Then, we design an original methodology to estimate this quality, and we use these estimations to create an accurate sequential deep learning model (binary accuracy above 95%). Finally, we empirically demonstrate the value of predicting the quality of machine permutations by enhancing the performance of a simple Tabu Search algorithm inspired by the works in the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据