Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs |
scientific article; zbMATH DE number 1309393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs |
scientific article; zbMATH DE number 1309393 |
Statements
Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (English)
0 references
28 June 1999
0 references
discrete-continuous scheduling problems
0 references
metaheuristics simulated anneling
0 references
0 references
0 references
0.88629985
0 references
0.8765513
0 references
0.87511176
0 references
0.8743578
0 references
0.86845374
0 references
0.8671361
0 references
0 references
0.86253715
0 references
