Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances › Research Explorer

Novosibirsk State University's Research Portal

Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-030-72610-2_31
Final published version

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 9th International Conference, AIST 2020, Revised Selected Papers
Editors	Wil M. van der Aalst, Vladimir Batagelj, Dmitry I. Ignatov, Michael Khachay, Olessia Koltsova, Andrey Kutuzov, Sergei O. Kuznetsov, Irina A. Lomazova, Natalia Loukachevitch, Amedeo Napoli, Alexander Panchenko, Panos M. Pardalos, Marcello Pelillo, Andrey V. Savchenko, Elena Tutubalina
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	407-420
Number of pages	14
ISBN (Print)	9783030726096
DOIs	https://doi.org/10.1007/978-3-030-72610-2_31
Publication status	Published - 2021
Event	9th International Conference on Analysis of Images, Social Networks and Texts, AIST 2020 - Moscow, Russian Federation Duration: 15 Oct 2020 → 16 Oct 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12602 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Analysis of Images, Social Networks and Texts, AIST 2020
Country/Territory	Russian Federation
City	Moscow
Period	15.10.2020 → 16.10.2020

Research areas

Cumulative resources, Lower bound, Project management, PSPLIB, Renewable resources, Resource-constrained project scheduling problem

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES
1.01 MATHEMATICS

ID: 28470819