Pages that link to "Item:Q1278129"
From MaRDI portal
The following pages link to 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):
Displaying 18 items.
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
- On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- Simultaneous lotsizing and scheduling on parallel machines (Q1604070) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Dynamic nonlinear modelization of operational supply chain systems (Q2494311) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)