Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178)
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: Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm |
scientific article; zbMATH DE number 6558554
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm |
scientific article; zbMATH DE number 6558554 |
Statements
Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (English)
0 references
18 March 2016
0 references
supply chain scheduling
0 references
release times
0 references
batching
0 references
heuristic algorithm
0 references
worst case analysis
0 references
0 references
0 references
