The job shop scheduling problem with convex costs (Q1754305)
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 6876689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The job shop scheduling problem with convex costs |
scientific article; zbMATH DE number 6876689 |
Statements
The job shop scheduling problem with convex costs (English)
0 references
30 May 2018
0 references
scheduling
0 references
job shop
0 references
non-regular objective
0 references
convex costs
0 references
tabu search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8231838941574097
0 references
0.8220945000648499
0 references
0.8144747614860535
0 references
0.8043661713600159
0 references
0.7988715171813965
0 references
