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

DOI10.1016/J.IPL.2012.01.002MaRDI QIDQ413308zbMATH OpenOpenAlexFDO

Authors Wenhua Li, Sufang Yang, Zhenkun 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

online algorithmsschedulingcompetitive ratiolookaheadparallel batch

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Research on the parallel-batch scheduling with linearly lookahead model
• On-line scheduling on a machine of two families with lookahead
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• A best online algorithm for scheduling on two parallel batch machines
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Approximation algorithms in batch processing
• Best semi-online algorithms for unbounded parallel batch scheduling
• Control of a batch-processing machine: A computational approach
• How much can lookahead help in online single machine scheduling
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Scheduling unit length jobs on parallel machines with lookahead information

Cited in

(13)

• Online scheduling on a single machine with grouped processing times
• On-line scheduling on a machine of two families with lookahead
• 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
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling of incompatible unit-length job families with lookahead
• Online machine minimization with lookahead
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• Online interval scheduling on a single machine with finite lookahead
• Scheduling unit length jobs on parallel machines with lookahead information
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with 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)