3 papers
cs.DS2021
Scheduling on uniform and unrelated machines with bipartite incompatibility graphs
Tytus Pikies, Hanna Furmańczyk
In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two…
cs.CC2020
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
Klaus Jansen, Alexandra Lassota, Marten Maack +1
This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the s…
cs.DS2020
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
Tytus Pikies, Krzysztof Turowski, Marek Kubale
In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complet…