Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6687844 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
precedence constraints | |||
Property / zbMATH Keywords: precedence constraints / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sequence pair | |||
Property / zbMATH Keywords: sequence pair / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rectangle packing problem | |||
Property / zbMATH Keywords: rectangle packing problem / rank | |||
Normal rank |
Revision as of 02:58, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Handling precedence constraints in scheduling problems by the sequence pair representation |
scientific article |
Statements
Handling precedence constraints in scheduling problems by the sequence pair representation (English)
0 references
22 February 2017
0 references
scheduling
0 references
precedence constraints
0 references
sequence pair
0 references
rectangle packing problem
0 references