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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-010-0752-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080029023 / rank | |||
Normal rank | |||
Revision as of 21:42, 19 March 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
