Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57432779, #quickstatements; #temporary_batch_1706814575051 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57432779 / rank | |||
Normal rank | |||
Revision as of 20:40, 1 February 2024
scientific article
| 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 |
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
