#### DMCA

## Fundação Municipal de Ensino de Piracicaba (2004)

### Citations

220 | Dynamic version of the economic lot sizing model - Wagner, Whitin - 1958 |

92 | A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time, - Federgruen, Tzur - 1991 |

59 | Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, - Wagelmans, Hoesel, et al. - 1992 |

52 | A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach - Zangwill - 1969 |

51 | Speeding up dynamic programming with applications to molecular biology, - Galil, Giancarlo - 1989 |

48 |
Improved algorithms for economic lot size problems,
- Aggarwal, Park
- 1993
(Show Context)
Citation Context ... t if It ≥ 0; Ht( It) = ⎨ ⎩hbtIt if It ≤ 0. Lot-sizing problems can be written as follows (Zangwill, 1969): T ∑ ( + ( ) ) Min g ( x ) H I (1) t= 1 t t t t subject to xt + It−1 − It = dt t = 1,..., T; =-=(2)-=- I0= 0 (3) x ≥ 0 t = 1,..., T. (4) t The objective function (1) describes the sum of production and inventory costs. In (2), inventory balance constraints are presented. Without losing generality, con... |

43 | The capacitated lot sizing problem: a review of models and algorithms - Karimi, Ghomi, et al. |

39 | The concave least-weight subsequence problem revisited - Wilber - 1988 |

34 | sizing and scheduling - survey and extensions - Drexl, Kimms - 1997 |

32 | Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation - Wolsey |

31 |
Single item lot sizing problems.
- Brahimi, Dauzere-Peres, et al.
- 2006
(Show Context)
Citation Context ...oduction center problem. Let Ft denote the minimum production cost from period k up to period t, then Ft can be determined recursively as Ft = min [ Fk + Mkt] , 0 ≤ k ≤t−1 F0 = 0 t =1, 2, ........, T =-=(5)-=- where Mkt is define as the cost of producing in period i (k+1 ≤ i ≤ t), in order to meet the demands from period k + 1 to period t, where M kt ⎧sk+ 1+ ck+ 1dk+ 1 if t = k + 1 ⎪ = i−1 t−1 ⎨ ⎡ − + ⎤ ⎪ ... |

27 | Capacitated lot sizing with setup times - Trigeiro, Thomas, et al. - 1989 |

24 | Batching decisions: structure and models. - Kuik, Salomon, et al. - 1994 |

24 | Lot-size models with backlogging: strong reformulations and cutting planes - Pochet, Wolsey - 1988 |

22 |
Determining lot sizes and resource requirements: a review,
- BARL, RITZMAN, et al.
- 1987
(Show Context)
Citation Context ... 0; Ht( It) = ⎨ ⎩hbtIt if It ≤ 0. Lot-sizing problems can be written as follows (Zangwill, 1969): T ∑ ( + ( ) ) Min g ( x ) H I (1) t= 1 t t t t subject to xt + It−1 − It = dt t = 1,..., T; (2) I0= 0 =-=(3)-=- x ≥ 0 t = 1,..., T. (4) t The objective function (1) describes the sum of production and inventory costs. In (2), inventory balance constraints are presented. Without losing generality, constraint (3... |

17 | An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing", - Evans - 1985 |

15 |
A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing
- Diaby, Bahl, et al.
- 1992
(Show Context)
Citation Context ...– The network for several production centers. Let Ft denote the minimum production cost from period k up to period t, then Ft can be determined recursively as F = min [ F + M ] , t =1, 2, ........, T =-=(7)-=- t 0≤k≤t−1 1≤j≤m k ktj F0 = 0 where Mktj is define as the cost of producing in period i (k+1 ≤ i ≤ t) in the production center j (1 ≤ j ≤ m), in order to meet the demands from period k+ 1 to period t,... |

12 |
Capacitated lotsizing and scheduling by lagrangean relaxation
- Diaby, Bahl, et al.
- 1992
(Show Context)
Citation Context ... meet the demands from period k+ 1 to period t, M kt ⎧ sk+ 1, j+ ck+ 1, jdk+ 1 if t = k + 1 ⎪ = i−1 t−1 ⎨ ⎡ − + ⎤ ⎪ min ⎢sij + cij Di + ∑ hbI l l + ∑hI l l ⎥ k+ 1≤i≤t ⎩ ⎣ if t > k + 1. l= k+ 1 l= i ⎦ =-=(8)-=-swhere t i r r=+ i 1 Toledo & Shiguemoto – Lot-sizing problem with several production centers D = ∑ d is cumulative demand from period k+1 to t. By applying the recursive formula (7), the algorithm of... |

9 | The dynamic lot-sizing model with backlogging: A simple O(n logn) algorithm and minimal forecast horizon procedure, - Federgruen, Tzur - 1993 |

8 | Progress with single-item lot-sizing. - Wolsey - 1995 |

5 |
Economic Lot Scheduling for Multiple Products on Parallel Identical Processors;
- Carreno
- 1990
(Show Context)
Citation Context ... 1+ ck+ 1dk+ 1 if t = k + 1 ⎪ = i−1 t−1 ⎨ ⎡ − + ⎤ ⎪ min ⎢si + cD i i + ∑ hbI l l + ∑hI l l ⎥ k+ 1≤i≤t ⎩ ⎣ l= k+ 1 l= i ⎦ if t > k + 1. i r r=+ i 1 t D = ∑ d is cumulative demand from period k+1 to t. =-=(6)-=-sToledo & Shiguemoto – Lot-sizing problem with several production centers The Mkt values can be calculated in efficient away if we applied the computational modifications suggested by Evans (1985) for... |

5 | Primal-dual approach to the single level capacitated lot-sizing problem - Lozano, Larraneta, et al. - 1991 |

4 | A lagrangean-based heuristic for multiplant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers - Sambavisan, Yahya - 2005 |

4 | A single-product parallel-facilities production-planning model - Sung - 1986 |

1 |
Dynamic Programming Algorithms for the Parallel Machine Lot Sizing Problem
- Armentano, Toledo
- 1997
(Show Context)
Citation Context ...= ⎨ ⎩0 if xt= 0; and inventory costs of It are given by: ⎧hI t t if It ≥ 0; Ht( It) = ⎨ ⎩hbtIt if It ≤ 0. Lot-sizing problems can be written as follows (Zangwill, 1969): T ∑ ( + ( ) ) Min g ( x ) H I =-=(1)-=- t= 1 t t t t subject to xt + It−1 − It = dt t = 1,..., T; (2) I0= 0 (3) x ≥ 0 t = 1,..., T. (4) t The objective function (1) describes the sum of production and inventory costs. In (2), inventory bal... |

1 |
A data-dependent efficient implementation of the Wagner-Whitin algorithm for lot-sizing
- Bahl, Taj
- 1991
(Show Context)
Citation Context ...f It ≤ 0. Lot-sizing problems can be written as follows (Zangwill, 1969): T ∑ ( + ( ) ) Min g ( x ) H I (1) t= 1 t t t t subject to xt + It−1 − It = dt t = 1,..., T; (2) I0= 0 (3) x ≥ 0 t = 1,..., T. =-=(4)-=- t The objective function (1) describes the sum of production and inventory costs. In (2), inventory balance constraints are presented. Without losing generality, constraint (3) ensures that the initi... |

1 | An efficient algorithm for the dynamic economic lot size problem - Golany, Maman, et al. - 1992 |

1 | Planejamento da produção em máquinas paralelas sob restrições de capacidade - Neto, Z - 1993 |

1 | Dimensionamento de lotes em Máquinas Paralelas - Toledo - 1998 |