Loading [a11y]/accessibility-menu.js
A coordination mechanism for scheduling game on parallel machines with flexible maintenance | IEEE Conference Publication | IEEE Xplore

A coordination mechanism for scheduling game on parallel machines with flexible maintenance


Abstract:

This paper considers a scheduling game problem on identical parallel machines with flexible and periodic maintenance. Each machine needs to be maintained periodically, an...Show More

Abstract:

This paper considers a scheduling game problem on identical parallel machines with flexible and periodic maintenance. Each machine needs to be maintained periodically, and the interval of any two consecutive maintenance activities is in a given time window. Each job is owned by a selfish agent, whose objective is to minimize the completion time of its job. The system's objective is to minimize the makespan. We design an LPT-NF coordination mechanism based on the longest processing time (LPT) and next fit (NF) rules. Then we give a greedy LPT-NF algorithm to obtain the Nash Equilibrium, and the lower bound of the optimal solution. Finally, we evaluate the performance of the LPT-NF coordination mechanism with a set of computational experiments, and analyze the impact of maintenance time, the minimum maintenance spacing, and the maximum maintenance spacing on the Nash Equilibrium solutions. The results show that the Nash Equilibrium is very close to the optimal solution for all the experiments. In addition, it is shown that the LPT-NF coordination mechanism works well and tends to perform better when facing the larger-scale scenarios.
Date of Conference: 27-29 March 2018
Date Added to IEEE Xplore: 21 May 2018
ISBN Information:
Conference Location: Zhuhai, China

References

References is not available for this document.