Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493): Difference between revisions

Latest revision as of 15:40, 19 December 2024

scientific article

Language	Label	Description	Also known as
English	Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount	scientific article

Statements

instance of

scholarly article

0 references

title

Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (English)

0 references

author

Yaser Malekian

0 references

S. Hamid Mirmohammadi

0 references

Mehdi Bijari

0 references

published in

Computers \& Operations Research

0 references

publication date

9 March 2022

0 references

zbMATH Keywords

capacitated lot sizing problem

0 references

all-units quantity discount

0 references

polynomial exact algorithm

0 references

implicit enumeration algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2021.105373

0 references

cites work

Capacity Acquisition, Subcontracting, and Lot Sizing

0 references

Computational Complexity of the Capacitated Lot Size Problem

0 references

On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures

0 references

Pricing and production lot-size/scheduling with finite capacity for a deteriorating item over a finite horizon

0 references

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

0 references

A single-item economic lot-sizing problem with a non-uniform resource: Approximation

0 references

An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem

0 references

Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis

0 references

The dynamic lot size model with quantity discount

0 references

Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time

0 references

Deterministic Production Planning with Concave Costs and Capacity Constraints

0 references

Deterministic Production Planning: Algorithms and Complexity

0 references

A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

0 references

The stochastic lot-sizing problem with quantity discounts

0 references

Dynamic lot-sizing model under perishability, substitution, and limited storage capacity

0 references

Lot Sizing with Piecewise Concave Production Costs

0 references

Stochastic lot sizing problem with nervousness considerations

0 references

Dynamic Lot Sizing with Batch Ordering and Truckload Discounts

0 references

Dynamic lot sizing with all‐units discount and resales

0 references

Pricing for production and delivery flexibility in single-item lot-sizing

0 references

Bounded Production and Inventory Models with Piecewise Concave Costs

0 references

A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

0 references

An efficient optimal algorithm for the quantity discount problem in material requirement planning

0 references

Economic lot sizing with constant capacities and concave inventory costs

0 references

Improved exact algorithms to economic lot-sizing with piecewise linear production costs

0 references

A dynamic quantity discount lot size model with resales

0 references

A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs

0 references

Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem''

0 references

A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times

0 references

The stochastic lot sizing problem with piecewise linear concave ordering costs

0 references

An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

0 references

Dynamic Version of the Economic Lot Size Model

0 references

The dynamic lot size model with quantity discount: Counterexamples and correction

0 references

A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1016/J.COR.2021.105373

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2669493

@@ Property / DOI @@
-.1016/J.COR.2021.105373
@@ Property / DOI: 10.1016/J.COR.2021.105373 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.COR.2021.105373
@@ Property / DOI: 10.1016/J.COR.2021.105373 / rank @@
+Normal rank