Two-machine open shop problem with agreement graph

Abstract This paper addresses the problem of scheduling jobs on a two-machine open shop subject to constraints given by an agreement graph G, such that jobs can be processed simultaneously on different machines if and only if they are represented by adjacent vertices in G. The problem of minimizing the maximum completion time (makespan) is strongly NP-hard for three distinct values of processing times and for G being a bipartite graph. We extend the study presented in [3] and [4] to the proportionate open shop system. We first prove the NP-hardness of the case of two values of processing times and more general agreement graphs which closes definitely the complexity status of the problem. Then, we present some restricted cases that can be solved in polynomial time. We also derive new complexity results of the open shop under resource constraints and of the partition into triangles problem.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Mourad Boudhar,et al.  Flow shop scheduling problem with conflict graphs , 2018, Ann. Oper. Res..

[3]  Gerhard J. Woeginger,et al.  Geometric versions of the three-dimensional assignment problem under general norms , 2015, Discret. Optim..

[4]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[5]  Mourad Boudhar,et al.  Scheduling with agreements: new results , 2016 .

[6]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[7]  Mourad Boudhar,et al.  Scheduling jobs on identical machines with agreement graph , 2012, Comput. Oper. Res..

[8]  Frédéric Gardi.  Mutual exclusion scheduling with interval graphs or related classes, Part I , 2009, Discret. Appl. Math..

[9]  Mourad Boudhar,et al.  Open shop scheduling problems with conflict graphs , 2017, Discret. Appl. Math..

[10]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[11]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[12]  Hans L. Bodlaender,et al.  Partition Into Triangles on Bounded Degree Graphs , 2012, Theory of Computing Systems.

[13]  Mourad Boudhar,et al.  Two-machine flow shop problem with unit-time operations and conflict graph , 2017, Int. J. Prod. Res..

[14]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .

[15]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[16]  Mourad Boudhar,et al.  The two-machine flow shop problem with conflict graphs , 2016 .

[17]  Randy Goebel,et al.  Approximation algorithms for two-machine flow-shop scheduling with a conflict graph , 2018, COCOON.

[18]  Ammar Oulamara,et al.  Scheduling: Agreement graph vs resource constraints , 2015, Eur. J. Oper. Res..

[19]  Mourad Boudhar,et al.  New results in two identical machines scheduling with agreement graphs , 2019, Theor. Comput. Sci..