Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641)
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: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times |
scientific article; zbMATH DE number 5202101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times |
scientific article; zbMATH DE number 5202101 |
Statements
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (English)
0 references
19 October 2007
0 references
scheduling
0 references
availability constraint
0 references
branch and bound
0 references
integer programming
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.8542110919952393
0 references
0.8473541140556335
0 references
0.8461664915084839
0 references
0.8387256860733032
0 references
0.8375693559646606
0 references
