Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:35, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods |
scientific article |
Statements
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (English)
0 references
8 April 2011
0 references
scheduling
0 references
parallel machines
0 references
total weighted completion time
0 references
lower bound
0 references
availability constraints
0 references
