On-line scheduling on partial batch parallel machines with chains precedence constraints

DOI10.3969/J.ISSN.1007-0834.2011.02.013MaRDI QIDQ2887327zbMATH OpenFDO

Authors Qinghua Yao, Benhua Qiu

Publication date 1 June 2012

Published in Journal of Henan Institute of Education. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1007-0834.2011.02.013

zbMATH Keywords

chains-precedence constraintcompetitive rationlower boundon-line schedulingparallel batch

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Recommendations

• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• An on-line algorithm for the bounded P-batch scheduling with chain precedence constraints and unit processing time
• A best online algorithm for scheduling on two parallel batch machines

Cited in

(4)

• The composition chain algorithm and a class of single batch machine scheduling problems with chain precedence constraints
• An on-line algorithm for the bounded P-batch scheduling with chain precedence constraints and unit processing time
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

This page was built for publication: On-line scheduling on partial batch parallel machines with chains precedence constraints

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