Continuous Time MILP Models for Multi-Mode Resource Constrained Project Scheduling Problems

dc.contributor.author Guler Ozturk
dc.contributor.author Adalet Oner
dc.date.accessioned 2025-10-06T17:51:01Z
dc.date.issued 2020
dc.description.abstract Two 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.
dc.identifier.doi 10.1109/ICITM48982.2020.9080355
dc.identifier.isbn 9781728143064
dc.identifier.uri https://www.scopus.com/inward/record.uri?eid=2-s2.0-85084958244&doi=10.1109%2FICITM48982.2020.9080355&partnerID=40&md5=f14c521ab52013953b255b182db1689c
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/9248
dc.language.iso English
dc.publisher Institute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof 9th International Conference on Industrial Technology and Management ICITM 2020
dc.subject Continuous 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 Programming
dc.subject 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 programming
dc.title Continuous Time MILP Models for Multi-Mode Resource Constrained Project Scheduling Problems
dc.type Conference Object
dspace.entity.type Publication
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.type text::conference output
gdc.collaboration.industrial false
gdc.description.endpage 56
gdc.description.startpage 51
gdc.identifier.openalex W3021499916
gdc.index.type Scopus
gdc.oaire.diamondjournal false
gdc.oaire.impulse 1.0
gdc.oaire.influence 2.5001925E-9
gdc.oaire.isgreen true
gdc.oaire.popularity 2.007689E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 0202 electrical engineering, electronic engineering, information engineering
gdc.oaire.sciencefields 02 engineering and technology
gdc.openalex.collaboration National
gdc.openalex.fwci 0.359
gdc.openalex.normalizedpercentile 0.64
gdc.opencitations.count 2
gdc.plumx.crossrefcites 1
gdc.plumx.mendeley 5
gdc.plumx.scopuscites 5
oaire.citation.endPage 56
oaire.citation.startPage 51
person.identifier.scopus-author-id Ozturk- Guler (57216844283), Oner- Adalet (48361901600)
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files