Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable

Simple item page
dc.contributor.authorNieuwoudt I
dc.contributor.authorVan Vuuren JH
dc.date.accessioned2013-07-03T08:19:05Z
dc.date.available2013-07-03T08:19:05Z
dc.date.issued2012
dc.descriptionEkonomiese En Bestuurswetenskappe
dc.descriptionLogistiek
dc.descriptionPlease help us populate SUNScholar with the post print version of this article. It can be e-mailed to: scholar@sun.ac.za
dc.identifier.citationJournal of Scheduling
dc.identifier.urihttp://hdl.handle.net/10019.1/81769
dc.publisherKLUWER ACADEMIC PUBL, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ
dc.titleAlgorithms for a shared resource scheduling problem in which some level of conflict is tolerable
dc.typeJournal Articles (subsidised)
Files
Collections
2012 - Research Outputs