Online scheduling on unbounded parallel-batch machines with incompatible job families
From MaRDI portal
Publication:533882
DOI10.1016/j.tcs.2011.01.023zbMath1216.68347OpenAlexW1966397500MaRDI QIDQ533882
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.023
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval, Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components, Online over time scheduling on parallel-batch machines: a survey, Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
Cites Work
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Scheduling a batching machine
- Approximation algorithms in batch processing
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- The Batch Loading and Scheduling Problem
- Scheduling batch processing machines with incompatible job families
