New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718)
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 7633821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources |
scientific article; zbMATH DE number 7633821 |
Statements
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (English)
0 references
19 December 2022
0 references
scheduling
0 references
sequencing
0 references
labeling algorithm
0 references
branch-cut-and-price
0 references
iterated local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8384948968887329
0 references
0.7442471385002136
0 references
0.7279109358787537
0 references
0.7173198461532593
0 references
0.70441073179245
0 references
