A note on flow-based formulations for solving resource constrained scheduling problems

Simple item page
dc.contributor.authorTerblanche, S. E.en_ZA
dc.contributor.authorVan Vuuren, J. H.en_ZA
dc.date.accessioned2019-02-21T11:55:21Z
dc.date.available2019-02-21T11:55:21Z
dc.date.issued2017
dc.descriptionCITATION: Terblanche, S. E. & Van Vuuren, J. H. 2017. A note on ow-based formulations for solving resource constrained scheduling problems. ORiON, 33(1):21-34, doi:10.5784/33-1-555.
dc.descriptionThe original publication is available at http://orion.journals.ac.za
dc.description.abstractThe resource constrained scheduling problem involves the scheduling of a number of activities over time, where each activity consumes one or more resources per time period. For a feasible solution to exist, the total resource consumption per time period must not exceed the available resources. In addition, the order in which activities may be scheduled is determined by a precedence graph. In this paper, valid inequalities proposed for the resource ow-based formulation in previous studies are investigated to determine what e ect they may have on computing times. It is shown empirically that improved computing times may be obtained if these valid inequalities are, in fact, omitted from the resource ow-based formulation. In addition, a heuristic is proposed for the generation of initial starting solutions and for estimating the extent of the scheduling horizon which, in turn, is required to calculate the latest starting times of activities. The computational results are based on well-known problem test instances as well as new randomly generated problem instances.en_ZA
dc.description.urihttp://orion.journals.ac.za/pub/article/view/555
dc.description.versionOperations Research Society of South Africa
dc.format.extent14 pages
dc.identifier.citationTerblanche, S. E. & Van Vuuren, J. H. 2017. A note on ow-based formulations for solving resource constrained scheduling problems. ORiON, 33(1):21-34, doi:10.5784/33-1-555
dc.identifier.issn2224-0004 (online)
dc.identifier.issn0259-191X (print)
dc.identifier.otherdoi:10.5784/33-1-555
dc.identifier.urihttp://hdl.handle.net/10019.1/105453
dc.language.isoen_ZAen_ZA
dc.publisherOperations Research Society of South Africa
dc.rights.holderAuthors retain copyright
dc.subjectSchedulingen_ZA
dc.subjectTime managementen_ZA
dc.subjectFlow-based formulationsen_ZA
dc.subjectInteger programmingen_ZA
dc.subjectInequalities (Mathematics)en_ZA
dc.subjectLinear progammingen_ZA
dc.subjectBinary system (Mathematics) -- Decisionen_ZA
dc.titleA note on flow-based formulations for solving resource constrained scheduling problemsen_ZA
dc.typeArticleen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
terblanche_note_2017.pdf
Size:
406.04 KB
Format:
Adobe Portable Document Format
Description:
Download article
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Research Articles (Industrial Engineering)