Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756)
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: Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system |
scientific article; zbMATH DE number 7754321
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system |
scientific article; zbMATH DE number 7754321 |
Statements
Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (English)
0 references
25 October 2023
0 references
distributed flow-shop
0 references
just-in-time scheduling
0 references
\( \mathcal{N}\mathcal{P} \)-hardness
0 references
pseudo-polynomial time algorithm
0 references
0 references
0 references
0 references
0 references
