Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / rank | |||
Normal rank | |||
Latest revision as of 19:08, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing weighted number of just-in-time jobs on unrelated parallel machines |
scientific article |
Statements
Maximizing weighted number of just-in-time jobs on unrelated parallel machines (English)
0 references
15 May 2007
0 references
just-in-time jobs
0 references
unrelated parallel machines
0 references
polynomial time algorithm
0 references
NP-hardness
0 references
0 references
