Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684)
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: Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost |
scientific article; zbMATH DE number 6853830
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost |
scientific article; zbMATH DE number 6853830 |
Statements
Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (English)
0 references
28 March 2018
0 references
two-agent
0 references
supply chain scheduling
0 references
algorithm
0 references
0 references
