Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies (Q1789450)
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: Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies |
scientific article; zbMATH DE number 6950227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies |
scientific article; zbMATH DE number 6950227 |
Statements
Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies (English)
0 references
10 October 2018
0 references
scheduling
0 references
availability
0 references
makespan
0 references
average-case analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8864734172821045
0 references
0.826460063457489
0 references
0.8249078392982483
0 references
0.8192986249923706
0 references
