Sciact
  • EN
  • RU

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems Full article

Journal Theoretical Computer Science
ISSN: 0304-3975
Output data Year: 2003, Volume: 306, Number: 1-3, Pages: 319-338 Pages count : 20 DOI: 10.1016/s0304-3975(03)00288-3
Tags Multicriteria optimization; Polynomial time approximation; Scheduling
Authors Angel Eric 1 , Bampis Evripidis 1 , Kononov Alexander 1,2
Affiliations
1 IBISC, Universit´e d’Evry, France
2 Sobolev Institute of Mathematics
Cite: Angel E. , Bampis E. , Kononov A.
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science. 2003. V.306. N1-3. P.319-338. DOI: 10.1016/s0304-3975(03)00288-3 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000185261500019
Scopus: 2-s2.0-0041387627
OpenAlex: W2033248211
Citing:
DB Citing
Scopus 37
OpenAlex 43
Web of science 27
Altmetrics: