A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/scheduling/MassaboPR16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/scheduling/MassaboPR16
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alex_J._Ruiz-Torres
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_Paletta
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ivar_Massab%E2%88%9A%E2%89%A4
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10951-015-0453-x
>
foaf:
homepage
<
https://doi.org/10.1007/s10951-015-0453-x
>
dc:
identifier
DBLP journals/scheduling/MassaboPR16
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10951-015-0453-x
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/scheduling
>
rdfs:
label
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alex_J._Ruiz-Torres
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_Paletta
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ivar_Massab%E2%88%9A%E2%89%A4
>
swrc:
number
2
(xsd:string)
swrc:
pages
207-211
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/scheduling/MassaboPR16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/scheduling/MassaboPR16
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/scheduling/scheduling19.html#MassaboPR16
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10951-015-0453-x
>
dc:
title
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
19
(xsd:string)