A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / 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: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the maximum number of on-time jobs on parallel identical machines. / rank | |||
Normal rank | |||
Latest revision as of 15:56, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines |
scientific article |
Statements
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (English)
0 references
2 September 2005
0 references
Scheduling
0 references
Identical parallel machines
0 references
Just-in-time jobs
0 references
0 references
