A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem

The execution of a project is nowadays often distributed among multiple sites. While some resource units are available at a certain site only, other resource units can be moved across the sites. The problem considered here consists of scheduling a single projects' activities which are interrela...

Full description

Saved in:
Bibliographic Details
Published in:IEEE International Conference on Industrial Engineering and Engineering Management pp. 611 - 614
Main Authors: Gnagi, M., Trautmann, N.
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2019
Subjects:
Industrial engineering
Job shop scheduling
Linear programming
Mathematical programming
Multiple Sites
Operations research
Planning
Project Planning
Renewable energy sources
Transportation
ISSN:2157-362X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The execution of a project is nowadays often distributed among multiple sites. While some resource units are available at a certain site only, other resource units can be moved across the sites. The problem considered here consists of scheduling a single projects' activities which are interrelated by given precedence relationships of the completion-start type, require various renewable resource types during execution, and can be executed at the different sites of the project, such that the project makespan is minimized; transportation times must be taken into account if a resource unit is moved between two sites, or if two activities interrelated by a precedence relationship are executed at different sites. We present a continuous-time formulation of this problem as a mixed-binary linear program. In an experiment based on a set of 480 instances, we compared the performance of this novel formulation with a discrete-time formulation, which is the only formulation known from the literature; it turned out that when using the novel continuous-time formulation, considerably more instances can be solved to feasibility and to optimality, respectively.
AbstractList The execution of a project is nowadays often distributed among multiple sites. While some resource units are available at a certain site only, other resource units can be moved across the sites. The problem considered here consists of scheduling a single projects' activities which are interrelated by given precedence relationships of the completion-start type, require various renewable resource types during execution, and can be executed at the different sites of the project, such that the project makespan is minimized; transportation times must be taken into account if a resource unit is moved between two sites, or if two activities interrelated by a precedence relationship are executed at different sites. We present a continuous-time formulation of this problem as a mixed-binary linear program. In an experiment based on a set of 480 instances, we compared the performance of this novel formulation with a discrete-time formulation, which is the only formulation known from the literature; it turned out that when using the novel continuous-time formulation, considerably more instances can be solved to feasibility and to optimality, respectively.
Author Trautmann, N.
Gnagi, M.
Author_xml – sequence: 1
  givenname: M.
  surname: Gnagi
  fullname: Gnagi, M.
  organization: University of Bern,Department of Business Administration,Bern,Switzerland,3012
– sequence: 2
  givenname: N.
  surname: Trautmann
  fullname: Trautmann, N.
  organization: University of Bern,Department of Business Administration,Bern,Switzerland,3012
BookMark eNotkM1KAzEcxKMoWGufQJC8QGqSTfNxrKXVQotie_BW0t1_2pTdRLJZ0JuP7oo9zTAwP5i5RVchBkDogdExY9Q8LufztRATxcecMjPWRmnN2AUa9YYprlmhqZCXaMDZRJFC8o8bNGrbE6WUcS25kQP0M8WzGLIPXexasvUN4LX_goo8-WDTN175ADbhtxQPyTaNDwe8iKnpapt9DNjFhPOx73R19mTjM-B3aGOXSiA9t83J9oDqr3-CMuNNeYSqq_8wfbSvoblD187WLYzOOkTbxXw7eyGr1-flbLointMiE0sts1xbyoSEieZWKAl7Y4G5SipjnDJUAZWG752sClGJwlbCcWV16VxZDNH9P9YDwO4z-aZftztfVvwC61hlGg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IEEM44572.2019.8978811
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781728138046
1728138043
EISSN 2157-362X
EndPage 614
ExternalDocumentID 8978811
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i203t-a0a1a28a0146e582a476eb9ae1fd6799f7907e0692bf6d34d43ad4f27a8cffc3
IEDL.DBID RIE
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000541902500122&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 07:40:04 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-a0a1a28a0146e582a476eb9ae1fd6799f7907e0692bf6d34d43ad4f27a8cffc3
PageCount 4
ParticipantIDs ieee_primary_8978811
PublicationCentury 2000
PublicationDate 2019-Dec.
PublicationDateYYYYMMDD 2019-12-01
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-Dec.
PublicationDecade 2010
PublicationTitle IEEE International Conference on Industrial Engineering and Engineering Management
PublicationTitleAbbrev IEEM
PublicationYear 2019
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001286296
Score 2.1171095
Snippet The execution of a project is nowadays often distributed among multiple sites. While some resource units are available at a certain site only, other resource...
SourceID ieee
SourceType Publisher
StartPage 611
SubjectTerms Industrial engineering
Job shop scheduling
Linear programming
Mathematical programming
Multiple Sites
Operations research
Planning
Project Planning
Renewable energy sources
Transportation
Title A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem
URI https://ieeexplore.ieee.org/document/8978811
WOSCitedRecordID wos000541902500122&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKxQALHy3iWx4YMY0TJ7ZHQFQMtKrUCnWrnNhGGQiotIiRn86dE0qRWNgsS-dIPiu-d753j5ALHdtC5cYxdDcT3HCWJ04xr0wibOp9FqQTHh_kcKimUz1qkcsVF8Y5F4rP3BUOw1u-fSmWmCrrKY3NzwHrbEiZ1VyttXwKxOY6a0jAPNI9QEsDIVKJdCsOJ6I2_qWiEi6R_s7_Pr9Luj9sPDpa3TN7pOWqfbK91kiwQz6vKbaZKqslAHmGtA46KD-cZTeBbksBccKJxlWwGOsZbGgfgtVGuotC4EohEKSBjcvGEIXS77Q-Q0XPoCPhLNpj2oaOwdMWS9ifcAoFabpk0r-b3N6zRluBlXGULJiJDDexMtg7xqUqNkJmLtfGcW8zqbWXgJpdlOk495kFt4nEWOFjaVThfZEckHb1UrlDQp2U3MIS1ngupI7hr2VzxLhFalLr_RHp4FbOXuvuGbNmF4__nj4hW-itumDklLQX86U7I5vF-6J8m58Hl38BrqewKg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lCurFRyu-zcGjsfvIbpKjiqViWwot0lvJbhLZg1uprXj0pzuTrlrBi7cQmLBkwma-yXzzEXKhIpPLTFuG7mY81CHLYiuZkzrmJnEu9dIJj13R78vxWA1q5PKbC2Ot9cVn9gqH_i3fTPMFpspaUmHzc8A6a6icVbG1VjIqEJ2rtKIBh4FqAV7qcZ4IJFyFcCaW5r90VPw10t7-3wfskOYPH48Ovm-aXVKz5R7ZWmkl2CAf1xQbTRXlAqA8Q2IH7RXv1rAbT7ilgDnhTOMqWI71DDa0DeFqJd5FIXSlEApSz8dlQ4hD6Vdin6Gmp1eSsAbtMXFDh-Brg0XsTziFkjRNMmrfjW47rFJXYEUUxHOmAx3qSGrsHmMTGWkuUpspbUNnUqGUE4CbbZCqKHOpAcfxWBvuIqFl7lwe75N6OS3tAaFWiNDAEka7kAsVwX_LZIhy80QnxrlD0sCtnLws-2dMql08-nv6nGx0Rr3upHvffzgmm-i5ZfnICanPZwt7Stbzt3nxOjvz7v8EBQuzcw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+International+Conference+on+Industrial+Engineering+and+Engineering+Management&rft.atitle=A+Continuous-Time+Mixed-Binary+Linear+Programming+Formulation+for+the+Multi-Site+Resource-Constrained+Project+Scheduling+Problem&rft.au=Gnagi%2C+M.&rft.au=Trautmann%2C+N.&rft.date=2019-12-01&rft.pub=IEEE&rft.eissn=2157-362X&rft.spage=611&rft.epage=614&rft_id=info:doi/10.1109%2FIEEM44572.2019.8978811&rft.externalDocID=8978811