An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/eor/ArkhipovBL19>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Alexander_A._Lazarev>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Dmitry_I._Arkhipov>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Olga_Batta%E2%88%9A%C4%AEa>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1016%2Fj.ejor.2018.11.005>
foaf:homepage	<https://doi.org/10.1016/j.ejor.2018.11.005>
dc:identifier	DBLP journals/eor/ArkhipovBL19 (xsd:string)
dc:identifier	DOI doi.org%2F10.1016%2Fj.ejor.2018.11.005 (xsd:string)
dcterms:issued	2019 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/eor>
rdfs:label	An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Alexander_A._Lazarev>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Dmitry_I._Arkhipov>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Olga_Batta%E2%88%9A%C4%AEa>
swrc:number	1 (xsd:string)
swrc:pages	35-44 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/eor/ArkhipovBL19/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/eor/ArkhipovBL19>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/eor/eor275.html#ArkhipovBL19>
rdfs:seeAlso	<https://doi.org/10.1016/j.ejor.2018.11.005>
dc:title	An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	275 (xsd:string)