Scheduling with tree-hierarchical processing set restrictions

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.04.009MaRDI QIDQ4986067zbMATH OpenFDO

Authors

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.04.009

zbMATH Keywords

delivery timeparallel machinespolynomial-time approximation schemeschedulingtree-hierarchical processing set

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling jobs with release and delivery times subject to nested eligibility constraints
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Fast approximation algorithms for job scheduling with processing set restrictions
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

Cited in

(1)

• Task assignment in tree-like hierarchical structures

This page was built for publication: Scheduling with tree-hierarchical processing set restrictions

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