Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms (Q7030972)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7980944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms |
scientific article; zbMATH DE number 7980944 |
Statements
Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms (English)
0 references
7 February 2025
0 references
short-term production planning
0 references
multi-agent scheduling
0 references
conflicting tasks
0 references
polynomial-time optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
