An effective heuristic algorithm for the partial shop scheduling problem (Q1652579)
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 6901568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective heuristic algorithm for the partial shop scheduling problem |
scientific article; zbMATH DE number 6901568 |
Statements
An effective heuristic algorithm for the partial shop scheduling problem (English)
0 references
11 July 2018
0 references
partial shop scheduling
0 references
mixed shop scheduling
0 references
group shop scheduling
0 references
open shop scheduling
0 references
heuristic
0 references
iterated tabu search
0 references
0 references
0 references
0 references
0.797606885433197
0 references
0.7869834303855896
0 references
0.7853509783744812
0 references
0.7831951975822449
0 references
0.7780105471611023
0 references
