Scheduling jobs on identical machines with agreement graph

Authors:
Mohamed Bendraouche;Mourad Boudhar
Affiliations:
Faculty of Sciences, Saad Dahleb University, Route de Soumaa-Blida, BP 270, Blida, Algeria;Faculty of Mathematics, USTHB University, BP 32 El-Alia, Bab Ezzouar, Alger, Algeria
Venue:
Computers and Operations Research
Year:
2012

Citing 16
Cited 0

Analysis of preflow push algorithms for maximum network flow

SIAM Journal on Computing
NP-completeness of graph decomposition problems

Journal of Complexity
Bounded vertex colorings of graphs

Discrete Mathematics
Stable sets and polynomials

Proceedings of the first Malta conference on Graphs and combinatorics
Restrictions of graph partition problems. Part I

Theoretical Computer Science
Mutual exclusion scheduling

Theoretical Computer Science
Restricted coloring models for timetabling

Proceedings of an international symposium on Graphs and combinatorics
Matching and multidimensional matching in chordal and strongly chordal graphs

Discrete Applied Mathematics
Bounded vertex coloring of trees

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on greedy algorithms for the maximum weighted independent set problem

Discrete Applied Mathematics
On Complexity of Some Chain and Antichain Partition Problems

WG '91 Proceedings of the 17th International Workshop
The mutual exclusion scheduling problem for permutation and comparability graphs

Information and Computation
Multicoloring trees

Information and Computation
Mutual exclusion scheduling with interval graphs or related classes, Part I

Discrete Applied Mathematics
Scheduling with conflicts: online and offline algorithms

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the following problem of scheduling with agreements: a set of jobs must be scheduled non-preemptively on identical machines subject to constraints that only some specific jobs can be scheduled concurrently on different machines. These constraints are represented by an agreement graph and the aim is to minimize the makespan. This problem is NP-hard. We study the complexity of the problem for two machines and arbitrary bipartite agreement graphs, in particular we prove the NP-hardness of the open problem proposed in the literature which is the case of two machines with processing times at most 3. We propose list algorithms with empirical results for the problem in the general case.