Exact Methods for the Single-Item Multi-Plant Capacitated Lot Sizing Problem Coupled with Transportation

SSRN Electronic Journal ◽

10.2139/ssrn.1010628 ◽

2007 ◽

Author(s):

Ayse Akbalik ◽

Bernard Penz

Keyword(s):

Exact Methods ◽

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs

International Journal of Production Economics ◽

10.1016/j.ijpe.2009.03.010 ◽

2009 ◽

Vol 119 (2) ◽

pp. 367-379 ◽

Author(s):

Ayşe Akbalik ◽

Bernard Penz

Keyword(s):

Production Costs ◽

Exact Methods ◽

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing ◽

Alternative Machines

Download Full-text

Corrigendum to “A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs” [Eur. J. Oper. Res. 222 (2012) 10–16]

European Journal of Operational Research ◽

10.1016/j.ejor.2013.01.051 ◽

2013 ◽

Vol 229 (1) ◽

pp. 279 ◽

Author(s):

Bertrand Hellion ◽

Fabien Mangione ◽

Bernard Penz

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Minimum Order ◽

Single Item ◽

Concave Costs ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing ◽

Order Quantities

Download Full-text

An Algorithm for the Single-Item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs

Journal of the Operational Research Society ◽

10.2307/2584017 ◽

1994 ◽

Vol 45 (8) ◽

pp. 934 ◽

Author(s):

Vahid Lotfi ◽

Yong-Seok Yoon

Keyword(s):

Single Item ◽

Holding Costs ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem

International Journal of Engineering ◽

10.5829/idosi.ije.2014.27.08b.08 ◽

2014 ◽

Vol 27 (8 (B)) ◽

Keyword(s):

Heuristic Algorithms ◽

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem

International Journal of Production Research ◽

10.1080/00207543.2010.532921 ◽

2011 ◽

Vol 49 (9) ◽

pp. 2567-2585 ◽

Author(s):

Ayşe Akbalik ◽

Bernard Penz

Keyword(s):

Time Window ◽

Just In Time ◽

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

AnO(nlogn)algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging

International Journal of Production Research ◽

10.1080/00207543.2013.857058 ◽

2013 ◽

Vol 52 (13) ◽

pp. 3758-3761 ◽

Author(s):

Mikhail Y. Kovalyov ◽

Erwin Pesch

Keyword(s):

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

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

Computers & Operations Research ◽

10.1016/j.cor.2021.105373 ◽

2021 ◽

pp. 105373

Author(s):

Yaser Malekian ◽

S. Hamid Mirmohammadi ◽

Mehdi Bijari

Keyword(s):

Polynomial Time ◽

Quantity Discount ◽

Single Item ◽

Polynomial Time Algorithms ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs

European Journal of Operational Research ◽

10.1016/j.ejor.2008.08.026 ◽

2009 ◽

Vol 198 (2) ◽

pp. 412-434 ◽

Author(s):

A. Akbalik ◽

Y. Pochet

Keyword(s):

Valid Inequalities ◽

Single Item ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs

Journal of the Operational Research Society ◽

10.1057/jors.1994.145 ◽

1994 ◽

Vol 45 (8) ◽

pp. 934-941 ◽

Author(s):

Vahid Lotfi ◽

Yong-Seok Yoon

Keyword(s):

Single Item ◽

Holding Costs ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing

Download Full-text

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

European Journal of Operational Research ◽

10.1016/j.ejor.2012.04.024 ◽

2012 ◽

Vol 222 (1) ◽

pp. 10-16 ◽

Author(s):

Bertrand Hellion ◽

Fabien Mangione ◽

Bernard Penz

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Minimum Order ◽

Single Item ◽

Concave Costs ◽

Lot Sizing Problem ◽

Capacitated Lot Sizing ◽

Order Quantities

Download Full-text