Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

DOI10.1016/j.ipl.2012.01.002zbMath1237.68036OpenAlexW2048950687MaRDI QIDQ413308

Sufang Yang, Wenhua Li, Zhen-Kun Zhang

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.002

zbMATH Keywords

schedulingonline algorithmscompetitive ratiolookaheadparallel batch

Mathematics Subject Classification ID

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

Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ Online scheduling on a single machine with grouped processing times ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ 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
• Best semi-online algorithms for unbounded parallel batch scheduling
• Scheduling unit length jobs on parallel machines with lookahead information
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• How much can lookahead help in online single machine scheduling
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• A best online algorithm for scheduling on two parallel batch machines
• 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
• On-line scheduling algorithms for a batch machine with finite capacity
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• On-line algorithms for minimizing makespan on batch processing machines
• Control of a batch-processing machine: A computational approach

This page was built for publication: Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead