Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/anor/LeungLP08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/anor/LeungLP08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Haibing_Li
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Y.-T._Leung
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_L._Pinedo
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10479-007-0270-5
>
foaf:
homepage
<
https://doi.org/10.1007/s10479-007-0270-5
>
dc:
identifier
DBLP journals/anor/LeungLP08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10479-007-0270-5
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/anor
>
rdfs:
label
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Haibing_Li
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Y.-T._Leung
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_L._Pinedo
>
swrc:
number
1
(xsd:string)
swrc:
pages
107-123
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/anor/LeungLP08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/anor/LeungLP08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/anor/anor159.html#LeungLP08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10479-007-0270-5
>
dc:
subject
Order scheduling; Total weighted completion time; Approximation algorithms; NP-hard
(xsd:string)
dc:
title
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
159
(xsd:string)