Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170)
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: Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness |
scientific article; zbMATH DE number 7546587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness |
scientific article; zbMATH DE number 7546587 |
Statements
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (English)
0 references
22 June 2022
0 references
production sequencing
0 references
sustainable manufacturing
0 references
flowshop scheduling
0 references
mixed-integer linear programming
0 references
heuristic cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8932638
0 references
0.8872433
0 references
0.88570714
0 references
0.8852341
0 references
0.88351065
0 references
0.8825726
0 references
0.8768363
0 references
