Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead

DOI10.1142/S0217595919500246zbMath1425.90044OpenAlexW2955061937MaRDI QIDQ5241278

Cheng-Wen Jiao, Jinjiang Yuan, Qi Feng

Publication date: 30 October 2019

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

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

zbMATH Keywords

competitive ratioonline schedulingparallel batchlinearly lookahead

Mathematics Subject Classification ID

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

Related Items (4)

Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families

Cites Work

• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Scheduling unit length jobs on parallel machines with lookahead information
• How much can lookahead help in online single machine scheduling
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• 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 new dynamic look-ahead scheduling procedure for batching machines
• 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
• On-line algorithms for minimizing makespan on batch processing machines

This page was built for publication: Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead