Guler OzturkAdalet Oner2025-10-062020978172814306410.1109/ICITM48982.2020.9080355https://www.scopus.com/inward/record.uri?eid=2-s2.0-85084958244&doi=10.1109%2FICITM48982.2020.9080355&partnerID=40&md5=f14c521ab52013953b255b182db1689chttps://gcris.yasar.edu.tr/handle/123456789/9248Two new continuous-time MILP (Mixed Integer Linear Programming) models are developed for resource constrained project scheduling problems in which activities can be conducted in different (multi) modes. There are efficient and flexible MILP models for this problem in which time is represented by a number of discrete time intervals. However they require to use large numbers of binary variables as the number of activities increases and time horizon stretches. Hence efforts have been made to formulate MILP models based on continuous-time representation and therefore to speed up the solution process. We propose two novel MILP models based on the event and resource flow concepts. The models are verified by solving benchmark problems in the literature. © 2020 Elsevier B.V. All rights reserved.EnglishContinuous Time Modeling, Milp Models, Multi-mode Activities, Project Management, Resource Constrained Project Scheduling, Continuous Time Systems, Scheduling, Bench-mark Problems, Binary Variables, Continuous-time Representation, Discrete Time Intervals, Mixed Integer Linear Programming, Multi-mode Resource-constrained Project Scheduling Problem, Resource-constrained Project Scheduling Problem, Solution Process, Integer ProgrammingContinuous time systems, Scheduling, Bench-mark problems, Binary variables, Continuous-time representation, Discrete time intervals, Mixed integer linear programming, Multi-mode resource-constrained project scheduling problem, Resource-constrained project scheduling problem, Solution process, Integer programmingContinuous Time MILP Models for Multi-Mode Resource Constrained Project Scheduling ProblemsConference Object