English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The resource constrained multi-mode multi-project scheduling problem(RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For agiven set of activities, feasible execution mode assignments and executionstarting times must be found such that some optimization function, e.g. themakespan, is optimized. When determining an optimal (or at least feasible)assignment of decision variable values, a set of side constraints, such asresource availabilities, precedence constraints, etc., has to be respected.  In 2013, the MISTA 2013 Challenge stipulated research in the RCMMMPSP. It'sgoal was the solution of a given set of instances under running timerestrictions. We have contributed to this challenge with the here presentedapproach.

Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem