Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264)
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 5228746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints |
scientific article; zbMATH DE number 5228746 |
Statements
Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (English)
0 references
21 January 2008
0 references
cyclic scheduling with setups
0 references
multiple products
0 references
robot
0 references
time windows
0 references
0 references
0 references
0.8145374655723572
0 references
0.8087348341941833
0 references
0.793340265750885
0 references
0.7926982641220093
0 references
0.791202962398529
0 references
