NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000384174 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing independent jobs with a single resource / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A multiple-criterion model for machine scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4034337 / rank | |||
Normal rank | |||
Latest revision as of 11:49, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time |
scientific article |
Statements
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (English)
0 references
22 January 2007
0 references
scheduling
0 references
single-variable-resource
0 references
total weighted completion time
0 references
NP-hardness
0 references
