Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of mean flow time scheduling problems with release times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing mean flow time with release time constraint / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3339651 / rank | |||
Normal rank | |||
Latest revision as of 04:44, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines |
scientific article |
Statements
Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (English)
0 references
23 November 2009
0 references
scheduling
0 references
uniform machines
0 references
equal length jobs
0 references
polynomial algorithm
0 references
