We consider the problem of scheduling multiple projects subject to joint resource constraints. All approaches proposed in the literature so far are based on the assumption that resources can be transferred from one project to the other without any expense in time or cost. In many realworld settings this assumption is not realistic. For example, cranes have to be transported to another location and reinstalled there. In order to consider this additional aspect, we generalise the multi-project scheduling problem by additionally including transfer times which represent transportation, installation, adjustment, (re-) learning and other setup activities necessary when a resource is removed from one project and reassigned to another (or from one job to another within the same project). In this paper, we define the modified multi-project scheduling problem with transfer times (called RCMPSPTT), formulate it as an integer linear programme, propose heuristic solution procedures and present results of comprehensive computational experiments.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Order Information: Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.
For technical questions regarding this item, or to correct its listing, contact: ().
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: