Workload Balancing in Parallel Machines based on Semi-matching Theory

DOI

10.2991/icmia-16.2016.145How to use a DOI?

Keywords

Parallel machine, Machine eligibility restrictions, Semi-matching, Load balancing.

Abstract

This paper addresses the problem of scheduling jobs on parallel machines with machine eligibility restrictions so as to balance the workload among machines. A weighted bipartite graph model G=[J M,E,W] is used to formulate the studied problem. We propose a two-phase algorithm to find the optimal solution. In phase 1,the initial solution construction algorithm is used to build an initial solution, followed by an improvement algorithm to improve the initial solution to optimal one in phase 2. Computational results are presented for a set of randomly generated instances.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yong Zhan
PY  - 2016/11
DA  - 2016/11
TI  - Workload Balancing in Parallel Machines based on Semi-matching Theory
BT  - Proceedings of the 2016 5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmia-16.2016.145
DO  - 10.2991/icmia-16.2016.145
ID  - Zhan2016/11
ER  -