Pages that link to "Item:Q4735007"
From MaRDI portal
The following pages link to Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems (Q4735007):
Displayed 18 items.
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
- Coordination mechanisms of supply chain systems (Q858405) (← links)
- The economic lot scheduling problem: a pure genetic search approach (Q878555) (← links)
- The economic lot scheduling problem under extended basic period and power-of-two policy (Q968005) (← links)
- The use of genetic algorithms to solve the economic lot size scheduling problem (Q1303538) (← links)
- A global optimum search algorithm for the joint replenishment problem under power-of-two policy. (Q1868815) (← links)
- Integrated pricing and lot-sizing decisions in a serial supply chain (Q2295084) (← links)
- A profit-maximizing economic lot scheduling problem with price optimization (Q2384842) (← links)
- Safety stock optimisation in two-echelon assembly systems: normal approximation models (Q3163169) (← links)
- Application of ELSP solution techniques to the deterministic robotic scheduling problem (Q4399098) (← links)
- Warehouse sizing to minimize inventory and storage costs (Q4434516) (← links)
- Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach (Q4474707) (← links)
- Improved randomized approximation algorithms for lot-sizing problems (Q4645935) (← links)
- Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes (Q4671384) (← links)
- Reduced production rates in the economic lot scheduling problem (Q4694103) (← links)
- Hybrid genetic algorithm for the economic lot-scheduling problem (Q4706269) (← links)
- Accounting for idle capacity cost in the scheduling of economic lot sizes (Q4823492) (← links)
- The economic lot scheduling problem under power-of-two policy (Q5948793) (← links)