Pages that link to "Item:Q5181063"
From MaRDI portal
The following pages link to Deterministic Production Planning with Concave Costs and Capacity Constraints (Q5181063):
Displaying 50 items.
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- Algorithms for the two-stage production-capacitated lot-sizing problem (Q312482) (← links)
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- The single-item green lot-sizing problem with fixed carbon emissions (Q320793) (← links)
- Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
- Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation (Q400033) (← links)
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
- Lot sizing with minimum order quantity (Q479047) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- Capacitated lot size problems with fuzzy capacity (Q597534) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- Network flow problems with pricing decisions (Q628654) (← links)
- A parametric optimization approach for uncertain linear quadratic models (Q682843) (← links)
- Capacity expansion planning for a single facility product line (Q795708) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- An integrated production and preventive maintenance planning model (Q877045) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost (Q943784) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Capacitated dynamic lot sizing problems in closed-loop supply chain (Q1042061) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- A dynamic production scheduling model with lost-sales or backlogging (Q1092803) (← links)
- On upper bounds of sequential stochastic production planning problems (Q1106717) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Production planning with time-dependent capacity bounds (Q1159564) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- A facilities in series capacity constrained dynamic lot-size model (Q1243658) (← links)
- Multi-item lot size determination and scheduling under capacity constraints (Q1243659) (← links)
- A capacity constrained singlefacility dynamic lot-size model (Q1245141) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Service system design with immobile servers, stochastic demand and concave-cost capacity selection (Q1652604) (← links)
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
