The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups (Q4022930)
From MaRDI portal
!
WARNING
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 98868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups |
scientific article; zbMATH DE number 98868 |
Statements
The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups (English)
0 references
17 January 1993
0 references
cyclic lot scheduling
0 references
single facility
0 references
sequence-dependent setup costs
0 references
heuristic solution procedure
0 references
Lagrangian relaxation
0 references
lot sizing
0 references
traveling salesman
0 references
minimum spanning tree
0 references
0.8737468123435974
0 references
0.8585308790206909
0 references
0.8273625373840332
0 references
0.8266094326972961
0 references
0.8227192163467407
0 references
