Batch processing with interval graph compatibilities between tasks

We analyze batch-scheduling problems that arise in connection with certain industrial applications. The models concern processing on a single max-batch machine with the additional feature that the tasks of the same batch have to be compatible. Compatibility is a symmetric binary relation-the compatible pairs are described with an undirected ''compatibility graph'', which is often an interval graph according to some natural practical conditions that we present. We consider several models with varying batch capacities, processing times or compatibility graphs. We summarize known results, and present a min-max formula and polynomial time algorithms.

[1]  Dorit S. Hochbaum,et al.  Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime , 1997, Oper. Res..

[2]  Phuong Loan Nguyen.  Planification tactique de la production : approche hiérarchisée pour une classe d'entreprises de sous-traitance et application au cas d'une entreprise de laminage à froid , 1997 .

[3]  Mihalis Yannakakis,et al.  Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

[4]  Rajiv Raman,et al.  Approximation Algorithms for the Max-coloring Problem , 2005, ICALP.

[5]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[6]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[7]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[8]  Gerd Finke,et al.  Scheduling on Batch Processing Machines with Constraints of Compatibility Between Jobs , 2000 .

[9]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[10]  Mourad Boudhar.  Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs , 2003, J. Math. Model. Algorithms.

[11]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[12]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[13]  Haris Gavranović.  Affectation de fréquences et conception optimale d'une ligne de production : modèles et algorithmes de résolution , 2002 .

[14]  Pierre Hansen,et al.  Bounded vertex colorings of graphs , 1990, Discret. Math..

[15]  D. de Werra,et al.  Time slot scheduling of compatible jobs , 2007, J. Sched..

[16]  Mourad Boudhar,et al.  Scheduling a batch processing machine with bipartite compatibility graphs , 2003, Math. Methods Oper. Res..

[17]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[18]  H. Bodlaender,et al.  Restrictions of Graph Partition Problems , 1993 .

[19]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[20]  Bruno Escoffier,et al.  Approximation polynomiale de problèmes d’optimisation : aspects structurels et opérationnels , 2005 .

[21]  Gerd Finke,et al.  Graph Partitioning and Set Covering for the Optimal Design of a Production System in the Metal Industry , 2000 .

[22]  Frédéric Gardi,et al.  Ordonnancement avec exclusion mutuelle par un graphe d'intervalles ou d'une classe apparentée : complexité et algorithmes , 2005 .

[23]  Vincent Jost.  Ordonnancement chromatique : polyèdres, complexité et classification , 2006 .

[24]  Klaus Jansen.  The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs , 1998, STACS.

[25]  Klaus Jansen,et al.  Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..