DEStech Transactions on Computer Science and Engineering
This volume contains refereed proceedings of the IX International Conference Optimization and Applications (OPTIMA 2018) held in Petrovac, Montenegro, October 1–5, 2018. The previous conferences during 2009–2017 years attracted a significant number of students, researchers, academics, and engineers working in the field of optimization theory, methods, software, and related areas. The Conference was organized by five institutions:
• The Montenegrin Academy of Sciences and Arts (Montenegro);
• Federal Research Center "Computer Science and Control" of Russian Academy of Science (Russia);
• University of Montenegro (Montenegro); University of Evora (Portugal);
• Institute of Information and Computational Technologies (Kazakhstan).
The Conference covered many optimization related areas ranging from pure theoretic studies to software and applications. The broad scope of OPTIMA made it an excellent collaboration platform for researchers from various domains related to optimization. The conference allowed specialists from different fields to present their work and discuss both theoretical and practical aspects of their research. Another important aim of the conference was to stimulate scientists and people from industry to benefit from the knowledge exchange and identify possible grounds for fruitful collaboration.
As a standard, DEStech will submit the technical science conference proceedings to be indexed in EI (Citation and Compendex). DEStech will submit the technical science conference proceedings to EI, Clarivate Analytics (formerly Thomson Reuters Web of Science) and CNKI Scholar for worldwide online citation
We consider a classic Resource-Constrained Project Scheduling Problem (RCPSP) which is known to be NP-hard. For defined project deadline T , each task of the project can be associated with its temporal domain – a time interval in which this task can be processed. In this research, we adopt existing resource-based methods of task domain propagation to generalized statement with time-dependent resource capacity and show how to improve its propagation efficiency. We also present new polynomial-time algorithms (propagators) to tighten such temporal task domains in order to make the optimization problem easier to solve. Moreover, we show how these propagators can be used to calculate lower bound on project makespan.