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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
