Employee workload balancing by graph partitioning

DOI10.1016/J.DAM.2013.02.014MaRDI QIDQ2448894zbMATH OpenOpenAlexFDO

Authors Alberto Ceselli, Fabio Colombo, Marco Trubian, Roberto Cordone

Publication date 5 May 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.02.014

zbMATH Keywords

graph partitioningtabu searchvery large scale neighbourhood search

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Dynamic balanced graph partitioning
• Balanced graph partitioning
• Dynamic load balancing with flexible workers
• scientific article; zbMATH DE number 553901
• scientific article; zbMATH DE number 4130424
• Parallelization of graph partitioning
• Employee positioning and workload allocation

Cites work

• Approximation algorithms for minimum \(K\)-cut
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Engineering multilevel graph partitioning algorithms
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Linear and quadratic programming approaches for the general graph partitioning problem
• Lower Bounds for the Partitioning of Graphs
• Packing and partitioning orbitopes
• Sparsest cuts and bottlenecks in graphs
• The case for strategic oscillation
• The node capacitated graph partitioning problem: A computational study

Cited in

(4)

• Simultaneous node and link districting in transportation networks: model, algorithms and railway application
• Rethinking structural balance in signed social networks
• Column-generation based bounds for the homogeneous areas problem
• A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas

Describes a project that uses

Uses Software

• KaFFPa
• Tabu search

This page was built for publication: Employee workload balancing by graph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448894)