Batch processing with interval graph compatibilities between tasks-Reference-Cited by-同舟云学术

Batch processing with interval graph compatibilities between tasks

Published:2008-03 Issue:5 Volume:156 Page:556-568
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Finke Gerd,Jost Vincent,Queyranne Maurice,Sebő András

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference29 articles.

1. Restrictions of graph partition problems, part I;Bodlaender;Theoret. Comput. Sci.,1995

2. C. Bornstein, J.L. Szwarcfiter, Personal communication, Rio de Janeiro, November 2003.

3. M. Boudhar, Static scheduling on a single batch processing machine with split compatibility graphs, Cahier No. 28, Laboratoire Leibniz, Grenoble, 2001.

4. Scheduling a batch processing machine with bipartite compatibility graphs;Boudhar;Math. Methods Oper. Res.,2003

5. Dynamic scheduling on a single batch processing machine with split compatibility graphs;Boudhar;J. Math. Modelling Algorithms,2003

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A PTAS for the horizontal rectangle stabbing problem;Mathematical Programming;2024-06-13

2. A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release Times and Job Compatibilities;Journal of the Operations Research Society of China;2023-04-04

3. Clustering Models Based on Graph Edge Coloring;Journal of Communications Technology and Electronics;2022-12

4. A PTAS for the Horizontal Rectangle Stabbing Problem;Integer Programming and Combinatorial Optimization;2022

5. SharpTNI: Counting and Sampling Parsimonious Transmission Networks under a Weak Bottleneck;2019-11-14