Auction-based approach for a flexible job-shop scheduling problem with multiple process plans (Q5059253)
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 7637077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Auction-based approach for a flexible job-shop scheduling problem with multiple process plans |
scientific article; zbMATH DE number 7637077 |
Statements
Auction-based approach for a flexible job-shop scheduling problem with multiple process plans (English)
0 references
23 December 2022
0 references
flexible job-shop scheduling problem
0 references
multiple process plans
0 references
auction-based approach
0 references
0 references
0 references
0 references
0 references
0 references
0.89324236
0 references
0.8817626
0 references
0.85685104
0 references
0.85056317
0 references
0.8491326
0 references
0.84696335
0 references
0.84632856
0 references
0.8451535
0 references
