A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5202104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property |
scientific article; zbMATH DE number 5202104 |
Statements
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (English)
0 references
19 October 2007
0 references
scheduling
0 references
parallel machines
0 references
job splitting
0 references
total tardiness
0 references
branch and bound
0 references
0 references
0 references
0.8580151796340942
0 references
0.8220248818397522
0 references
0.804338812828064
0 references
0.8035637736320496
0 references
0.8023597002029419
0 references
