Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (Q1278129)
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: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows |
scientific article; zbMATH DE number 1252731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows |
scientific article; zbMATH DE number 1252731 |
Statements
Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (English)
0 references
19 August 1999
0 references
discrete lotsizing
0 references
travelling salesman
0 references
time windows
0 references
sequence dependent set-up costs
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.93046623
0 references
0.8984437
0 references
0.88233966
0 references
0.8809436
0 references
0.8748498
0 references
0.87188476
0 references
0.8701082
0 references
0.86573094
0 references
0.8584817
0 references
