A note on the complexity of the problem of two-agent scheduling on a single machine.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/NgCY06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/NgCY06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/C._T._Ng_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jinjiang_Yuan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/T._C._Edwin_Cheng
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10878-006-9001-0
>
foaf:
homepage
<
https://doi.org/10.1007/s10878-006-9001-0
>
dc:
identifier
DBLP journals/jco/NgCY06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10878-006-9001-0
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
A note on the complexity of the problem of two-agent scheduling on a single machine.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/C._T._Ng_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jinjiang_Yuan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/T._C._Edwin_Cheng
>
swrc:
number
4
(xsd:string)
swrc:
pages
387-394
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/NgCY06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/NgCY06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco12.html#NgCY06
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10878-006-9001-0
>
dc:
subject
Production/scheduling; Multi-agent deterministic sequencing; Games/group decisions; Cooperative sequencing
(xsd:string)
dc:
title
A note on the complexity of the problem of two-agent scheduling on a single machine.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
12
(xsd:string)