Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval

DOI10.1142/S0217595922400127MaRDI QIDQ6053500zbMATH OpenOpenAlexFDO

Authors Wenhua Li, Libo Wang, Hang Yuan

Publication date 19 October 2023

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

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

zbMATH Keywords

batch schedulingcompetitive ratioincompatible job familiesonline algorithmvariable lookahead interval

Mathematics Subject Classification ID

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

Recommendations

• Online scheduling of incompatible unit-length job families with lookahead
• 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 scheduling on unbounded parallel-batch machines with incompatible job families

Cites work

• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• 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 algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
• Online scheduling of incompatible unit-length job families with lookahead
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Optimal on-line algorithms for one batch machine with grouped processing times

Cited in

(4)

• Online batch scheduling with kind release times and incompatible families to minimize makespan
• scientific article; zbMATH DE number 7235424 (Why is no real title available?)
• Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
• The online-scheduling problems with the bounded batch and incompatible job families on the unit flowshop machines

This page was built for publication: Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval

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