Please use this persistent identifier to cite or link to this item:
doi:10.24405/550
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Geiger, Martin Josef | - |
dc.date.accessioned | 2017-10-24T14:16:25Z | - |
dc.date.available | 2017-10-24T14:16:25Z | - |
dc.date.issued | 2015 | - |
dc.identifier.other | http://edoc.sub.uni-hamburg.de/hsu/volltexte/2015/3097/ | - |
dc.identifier.uri | https://doi.org/10.24405/550 | - |
dc.description.abstract | Debugging can be a tedious task. We know this from experience. With the program described in this paper, we try to help fellow researchers when implementing novel solution techniques for the multi-mode resource-constrained project scheduling problem (MRCPSP). The program supports in particular the MMLIB-instances of Van Peteghem and Vanhoucke (MMLIB50, MMLIB100, and MMLIB+). | - |
dc.description.sponsorship | BWL, insb. Logistik-Management | - |
dc.format | application/pdf | - |
dc.language.iso | eng | - |
dc.subject.ddc | 330 Wirtschaft | - |
dc.title | MMLIBchecker : a checker software for multi-mode resource-constrained project scheduling problem (MRCPSP) solution files | - |
dc.type | Working Paper | - |
dc.identifier.urn | urn:nbn:de:gbv:705-opus-30976 | - |
local.submission.type | full-text | - |
item.grantfulltext | open | - |
item.openairetype | Working Paper | - |
item.languageiso639-1 | en | - |
item.fulltext_s | With Fulltext | - |
item.fulltext | With Fulltext | - |
crisitem.author.dept | BWL, insb. Logistik-Management | - |
crisitem.author.orcid | 0000-0003-1797-957X | - |
crisitem.author.parentorg | Fakultät für Wirtschafts- und Sozialwissenschaften | - |
Appears in Collections: | 1 - Open Access Publications (except Theses) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
openHSU_550_1.pdf | 267.22 kB | Adobe PDF | View/Open | |
openHSU_550_2.zip | 12.07 kB | ZIP-Archiv | View/Open | |
openHSU_550_3.zip | 63.57 kB | ZIP-Archiv | View/Open |
CORE Recommender
Google ScholarTM
Check
User Tools
Items in openHSU are protected by copyright, with all rights reserved, unless otherwise indicated.