Online scheduling of incompatible unit-length job families with lookahead

DOI10.1016/j.tcs.2014.05.024zbMath1360.90129OpenAlexW1977081351MaRDI QIDQ2250449

Sufang Yang, Wenhua Li, Jinjiang Yuan

Publication date: 7 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.024

zbMATH Keywords

competitive ratiomakespanonline algorithmparallel-batch schedulingincompatible job families

Mathematics Subject Classification ID

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

Related Items

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence, Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval, Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead, Online scheduling of two-machine flowshop with lookahead and incompatible job families

Cites Work

• Unnamed Item
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Best semi-online algorithms for unbounded parallel batch scheduling
• Scheduling unit length jobs on parallel machines with lookahead information
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
• How much can lookahead help in online single machine scheduling
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• Approximation algorithms in batch processing
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• 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
• The Batch Loading and Scheduling Problem
• Control of a batch-processing machine: A computational approach