 |
Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates
1 : Informatique, BioInformatique, Systèmes Complexes
Université d'Évry-Val-d'Essonne : EA4526, Université Paris-Saclay, Université d'Évry-Val-d'Essonne
2 : Software College, Northeastern University
3 : School of Maritime Economics & Management, Dalian Maritime University
Multi-agent scheduling (MAS) models play an important role in improving customer satisfaction levels, in which the sequence and timing of tasks associated with different customers that act as agents are determined to optimise the customer-preference-based criterion. Given the NP-hardness of the MAS problems, different types of algorithms are suggested, including a branch and bound algorithm, a hybrid discrete artificial bee colony algorithm, and a deep reinforcement learning method.
