A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835)
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 7354063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A meta-heuristic to solve the just-in-time job-shop scheduling problem |
scientific article; zbMATH DE number 7354063 |
Statements
A meta-heuristic to solve the just-in-time job-shop scheduling problem (English)
0 references
3 June 2021
0 references
scheduling
0 references
just-in-time
0 references
weighted earliness-tardiness
0 references
heuristic
0 references
relaxation neighbourhood
0 references
relax-and-solve
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9012296199798584
0 references
0.790732741355896
0 references
0.7886560559272766
0 references
0.7827818393707275
0 references
0.7721442580223083
0 references
