A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779)
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: A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs |
scientific article; zbMATH DE number 6929755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs |
scientific article; zbMATH DE number 6929755 |
Statements
A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (English)
0 references
30 August 2018
0 references
supply chain scheduling
0 references
distribution
0 references
batch delivery
0 references
tardy jobs
0 references
0 references
0 references
0 references
0.8585042357444763
0 references
0.8423120379447937
0 references
0.8337557911872864
0 references
0.8158332705497742
0 references
