Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
From MaRDI portal
Publication:2410362
DOI10.1016/j.tcs.2017.07.022zbMath1380.90133OpenAlexW2742973704MaRDI QIDQ2410362
Xiangjuan Yao, Ji Tian, Qian Wang, Ruyan Fu
Publication date: 17 October 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.022
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Online over time scheduling on parallel-batch machines: a survey
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Scheduling an unbounded batching machine with job processing time compatibilities
- Dynamic scheduling on a single batch processing machine with split compatibility graphs
- Approximation algorithms in batch processing
- Scheduling a batch processing machine with bipartite compatibility graphs
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Scheduling with batching: A review
- Single-machine batch scheduling with job processing time compatibility
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Batch processing with interval graph compatibilities between tasks
- On-line algorithms for minimizing makespan on batch processing machines
- The Batch Loading and Scheduling Problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Bounds on Multiprocessing Timing Anomalies
