Equitable colouring and scheduling on identical machines

Sarah Nouri and Mourad Boudhar

International Journal of Mathematics in Operational Research, 2023, vol. 26, issue 3, 283-307

Abstract: This paper deals in the first place with the problems of two-equitable colouring of a union of complete bipartite graphs and three-equitable colouring of connected bipartite graphs, where their NP-completeness is proved. In the second place, it studies the scheduling problem of conflicting jobs on identical machines, while distributing the load evenly between them. Jobs with conflicting constraints cannot be executed on the same machine, these constraints are modelled by a conflict graph. Such problem with identical processing times can be seen as an m-equitable colouring. If the conflict graph is a star graph or a union of chains, this paper demonstrates that the addressed scheduling problem remains NP-hard. Furthermore, the paper describes mixed integer linear programming formulations, followed by some heuristics. The computational experiments show that one of the MILPs can optimally solve some instances with 100 jobs, and the proposed heuristics perform well.

Keywords: equitable colouring; scheduling; conflict graphs; heuristics; mixed integer linear programming; MILP. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134833 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:26:y:2023:i:3:p:283-307

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().