An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033)
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: An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes |
scientific article; zbMATH DE number 6901269
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes |
scientific article; zbMATH DE number 6901269 |
Statements
An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (English)
0 references
11 July 2018
0 references
bi-criteria
0 references
batch scheduling
0 references
group scheduling
0 references
unrelated-parallel machines
0 references
tabu search
0 references
sequence- and machine-dependent setup time
0 references
0 references
0 references
0 references
0 references
0 references
0 references
