Minimizing makespan for two parallel machines with job limit on each availability interval (Q5428993): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:42, 9 February 2024
scientific article; zbMATH DE number 5215853
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
