Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_27 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2516019428 / rank | |||
Normal rank | |||
Revision as of 20:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut |
scientific article |
Statements
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (English)
0 references
30 November 2016
0 references
polyhedral
0 references
valid inequalities
0 references
unrelated parallel machines
0 references
scheduling
0 references
precedence constraints
0 references
branch-and-cut
0 references
