Online scheduling of incompatible unit-length job families with lookahead

DOI10.1016/J.TCS.2014.05.024MaRDI QIDQ2250449zbMATH OpenOpenAlexFDO

Authors Wenhua Li, Jinjiang Yuan, Sufang Yang

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

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

Recommendations

• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• On-line scheduling on a machine of two families with lookahead
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
• Approximation algorithms in batch processing
• Best semi-online algorithms for unbounded parallel batch scheduling
• Control of a batch-processing machine: A computational approach
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• How much can lookahead help in online single machine scheduling
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Scheduling unit length jobs on parallel machines with lookahead information
• The Batch Loading and Scheduling Problem

Cited in

(11)

• 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
• Semi-online scheduling on two identical parallel machines with initial-lookahead information
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• Semi-online scheduling on two uniform parallel machines with initial lookahead
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
• Scheduling unit length jobs on parallel machines with lookahead information
• scientific article; zbMATH DE number 7235424 (Why is no real title available?)
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time

This page was built for publication: Online scheduling of incompatible unit-length job families with lookahead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250449)