A bicriterion problem of the scheduling theory taking the variation of servicing time into account

DOI10.1016/0041-5553(84)90181-2zbMath0588.90042OpenAlexW1977583446MaRDI QIDQ3716797

Alexander V. Tuzikov

Publication date: 1984

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(84)90181-2

zbMATH Keywords

Pareto setsbicriterion problemparallel unrelated machinesepsilon-approximationscheduling independent nonpreemptable tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

This page was built for publication: A bicriterion problem of the scheduling theory taking the variation of servicing time into account