Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.20133 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975363112 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank | |||
Normal rank | |||
Latest revision as of 16:34, 24 June 2024
scientific article; zbMATH DE number 5029981
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function |
scientific article; zbMATH DE number 5029981 |
Statements
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (English)
0 references
6 June 2006
0 references
scheduling
0 references
open-shop
0 references
resource allocation
0 references
optimization
0 references
equivalent load method
0 references
