Minimizing makespan for two parallel machines with job limit on each availability interval (Q5428993)
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: Minimizing makespan for two parallel machines with job limit on each availability interval |
scientific article; zbMATH DE number 5215853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan for two parallel machines with job limit on each availability interval |
scientific article; zbMATH DE number 5215853 |
Statements
Minimizing makespan for two parallel machines with job limit on each availability interval (English)
0 references
29 November 2007
0 references
scheduling
0 references
parallel machines
0 references
availability constraint
0 references
makespan
0 references
branch and bound method
0 references
0.8703537583351135
0 references
0.8522685170173645
0 references
0.8479710817337036
0 references
0.8322909474372864
0 references
