Branch-and-bound approach for optima localization in scheduling multiprocessor jobs

Branch-and-bound approach for optima localization in scheduling multiprocessor jobs Full article

Journal

International Transactions in Operational Research
ISSN: 0969-6016 , E-ISSN: 1475-3995

Output data

Year: 2020, Number: 27, Pages: 381 - 393 Pages count : 13 DOI: 10.1111/itor.12503

Tags

multiprocessor jobs; branch-and-bound algorithm; optima localization

Authors

Kononov Alexander ^1,2 , Kononova Polina ^1,2 , Gordeev Alexander ¹

Affiliations

1	Temporary Research Group “Optimization”, Sobolev Institute of Mathematics, 4, Akad. Koptyug Avenue, Novosibirsk, 630090, Russian Federation
2	Department of Mechanics and Mathematics, Novosibirsk State University, 2, Pirogova Str., Novosibirsk, 630090, Russian Federation

Kononov A. , Kononova P. , Gordeev A.
Branch-and-bound approach for optima localization in scheduling multiprocessor jobs
International Transactions in Operational Research. 2020. N27. P.381 - 393. DOI: 10.1111/itor.12503 WOS Scopus OpenAlex

Submitted:	Feb 5, 2017
Accepted:	Aug 25, 2017

Web of science:	WOS:000478733800017
Scopus:	2-s2.0-85070223396
OpenAlex:	W2778603107

DB	Citing
Scopus	4
OpenAlex	4
Web of science	3