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): Difference between revisions
From MaRDI portal
Revision as of 17:29, 28 May 2024
scientific article
| 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 |
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
