Makespan minimization for two parallel machines scheduling with a periodic availability constraint (Q1000962)
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 |
scientific article; zbMATH DE number 5506610
| 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 |
scientific article; zbMATH DE number 5506610 |
Statements
Makespan minimization for two parallel machines scheduling with a periodic availability constraint (English)
0 references
12 February 2009
0 references
scheduling
0 references
parallel machine
0 references
availability
0 references
heuristic algorithm
0 references
0 references
0 references
0.9154890179634094
0 references
0.9094430208206176
0 references
0.9041300415992736
0 references
0.8974088430404663
0 references
