Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136): 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: 90C10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6633434 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
assignment problems | |||
Property / zbMATH Keywords: assignment problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
branch and bound | |||
Property / zbMATH Keywords: branch and bound / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
metaheuristics | |||
Property / zbMATH Keywords: metaheuristics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed delivery dates | |||
Property / zbMATH Keywords: fixed delivery dates / rank | |||
Normal rank |
Revision as of 01:36, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness |
scientific article |
Statements
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (English)
0 references
6 October 2016
0 references
scheduling
0 references
assignment problems
0 references
branch and bound
0 references
metaheuristics
0 references
fixed delivery dates
0 references