Pages that link to "Item:Q1002081"
From MaRDI portal
The following pages link to On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081):
Displaying 16 items.
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- 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) (← links)
- A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem (Q1278236) (← links)
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
- Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
- Cluster analysis to minimize sequence dependent changeover times (Q1900258) (← links)
- A new heuristic and an exact approach for a production planning problem (Q2051214) (← links)
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm (Q2770123) (← links)
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures (Q2907902) (← links)
- Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs (Q5176341) (← links)
