Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval

DOI10.1142/s0217595922400127zbMath1525.90211OpenAlexW4220911579MaRDI QIDQ6053500

Wenhua Li, Libo Wang, Hang Yuan

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400127

zbMATH Keywords

competitive ratioonline algorithmbatch schedulingincompatible job familiesvariable lookahead interval

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal on-line algorithms for one batch machine with grouped processing times
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• On-line scheduling algorithms for a batch machine with finite capacity
• Online scheduling of incompatible unit-length job families with lookahead
• 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
• On-line algorithms for minimizing makespan on batch processing machines
• Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead