Job scheduling is widely used in real-world manufacturing systems to assign ordered job operations to machines under various constraints. Existing solutions remain limited by long running time or insufficient schedule quality, especially when problem scale increases. In this paper, we propose ReLA, a reinforcement-learning (RL) scheduler built on structured representation learning and aggregation. ReLA first learns diverse representations from scheduling entities, including job operations and machines, using two intra-entity learning modules with self-attention and convolution and one inter-entity learning module with cross-attention. These modules are applied in a multi-scale architecture, and their outputs are aggregated to support RL decision-making. Across experiments on small, medium, and large job instances, ReLA achieves the best makespan in most tested settings over the latest solutions. On non-large instances, ReLA reduces the optimality gap of the SOTA baseline by 13.0%, while on large-scale instances it reduces the gap by 78.6%, with the average optimality gaps lowered to 7.3% and 2.1%, respectively. These results confirm that ReLA's learned representations and aggregation provide strong decision support for RL scheduling, and enable fast job completion and decision-making for real-world applications.
Fairness-Aware Job Scheduling for Multi-Job Federated Learning
Nanyang Technological University(南洋理工大学);DSO National Laboratories(DSO国家实验室);Alibaba Group(阿里巴巴集团);Alibaba-NTU Singapore Joint Research Institute(阿里巴巴-新加坡南洋理工大学联合研究院)
Deep Reinforcement Learning for Multi-Resource Multi-Machine Job Scheduling
Research Center of Smart Networks and Systems, Fudan University(复旦大学智慧网络与系统研究中心);School of Operations Research and Information Engineering, Cornell University(康奈尔大学运筹学与信息工程学院)