Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098)
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: Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness |
scientific article; zbMATH DE number 7634065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness |
scientific article; zbMATH DE number 7634065 |
Statements
Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (English)
0 references
19 December 2022
0 references
parallel machine scheduling
0 references
total weighted tardiness
0 references
delivery times
0 references
mixed integer linear programming
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8455307483673096
0 references
0.8430518507957458
0 references
0.8247553110122681
0 references
0.8228294849395752
0 references
0.8180530667304993
0 references
