Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
DOI10.1016/J.IPL.2012.01.002zbMATH Open1237.68036OpenAlexW2048950687MaRDI QIDQ413308FDOQ413308
Zhenkun Zhang, Sufang Yang, Wenhua Li
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- A best online algorithm for scheduling on two parallel batch machines
- 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
- 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
- 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
- Scheduling unit length jobs on parallel machines with lookahead information
- How much can lookahead help in online single machine scheduling
- Control of a batch-processing machine: A computational approach
- Best semi-online algorithms for unbounded parallel batch scheduling
Cited In (8)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- Online scheduling on a single machine with grouped processing times
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling of incompatible unit-length job families with lookahead
- Online interval scheduling on a single machine with finite lookahead
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
- Research on the parallel-batch scheduling with linearly lookahead model
This page was built for publication: Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413308)
