Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity (Q6982587)
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 8042067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity |
scientific article; zbMATH DE number 8042067 |
Statements
Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity (English)
0 references
19 May 2025
0 references
scheduling
0 references
robotic cell
0 references
fixed processing time
0 references
time window
0 references
survey
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 references
