An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
From MaRDI portal
Publication:1679513
DOI10.1007/S10878-017-0139-8zbMath1383.90012OpenAlexW2615369083MaRDI QIDQ1679513
Jinjiang Yuan, Ji Tian, Ruyan Fu, Shi-Sheng Li
Publication date: 9 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0139-8
Related Items (1)
Cites Work
- 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
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Scheduling an unbounded batching machine with job processing time compatibilities
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling a batch processing machine with bipartite compatibility graphs
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- 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
- Unnamed Item
This page was built for publication: An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
