Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1208473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs |
scientific article; zbMATH DE number 1208473 |
Statements
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (English)
0 references
29 November 1998
0 references
local search heuristics
0 references
single machine
0 references
set-up time
0 references
number of late jobs
0 references
multi-start descent
0 references
simulated annealing
0 references
tabu search
0 references
genetic algorithm
0 references
0 references
0.9068998098373412
0 references
0.8362981677055359
0 references
0.8185522556304932
0 references
0.8109837770462036
0 references
