Uma heurística GRASP para o problema de dimensionamento de lotes com múltiplas plantas

[1]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[2]  Martin W. P. Savelsbergh,et al.  Integer-Programming Software Systems , 2005, Ann. Oper. Res..

[3]  S. David Wu,et al.  Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms , 2004, Comput. Optim. Appl..

[4]  Marc Salomon,et al.  Batching decisions: structure and models , 1994 .

[5]  Laurence A. Wolsey,et al.  Progress With Single-item Lot-sizing , 1995 .

[6]  James P. Kelly,et al.  A scatter-search-based learning algorithm for neural network training , 1996, J. Heuristics.

[7]  S. Goyal,et al.  Models for multi-plant coordination , 1993 .

[8]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[9]  Chang Sup Sung,et al.  A single-product parallel-facilities production-planning model , 1986 .

[10]  M. Resende,et al.  A GRASP for graph planarization , 1997 .

[11]  Ke Ding,et al.  A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover , 2001, Manag. Sci..

[12]  F. Toledo,et al.  A network flow model for the capacitated lot-sizing problem , 1999 .

[13]  Vinícius Amaral Armentano,et al.  Multi-item capacitated lot-sizing by a Cross decomposition based algorithm , 1994, Ann. Oper. Res..

[14]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[15]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[16]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[17]  Manuel Laguna,et al.  Tabu Search , 1997 .

[18]  Jatinder N. D. Gupta,et al.  Determining lot sizes and resource requirements: A review , 1987 .

[19]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[20]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[21]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[22]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[23]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[24]  Fred Glover,et al.  PROBABILISTIC AND PARAMETRIC LEARNING COMBINATIONS OF LOCAL JOB SHOP SCHEDULING RULES , 1963 .

[25]  Murali Sambasivan,et al.  A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers , 2005, Comput. Oper. Res..

[26]  Philip M. Kaminsky,et al.  Production and Distribution Lot Sizing in a Two Stage Supply Chain , 2003 .

[27]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[28]  Vinícius Amaral Armentano,et al.  A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines , 2006, Eur. J. Oper. Res..

[29]  A. Stuart,et al.  Non-Parametric Statistics for the Behavioral Sciences. , 1957 .

[30]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

[31]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[32]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[33]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[34]  Sebastián Lozano,et al.  Primal-dual approach to the single level capacitated lot-sizing problem , 1991 .

[35]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[36]  C. R. Sox,et al.  The capacitated lot sizing problem with setup carry-over , 1999 .

[37]  Harish C. Bahl,et al.  Capacitated lot-sizing and scheduling by Lagrangean relaxation , 1992 .

[38]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[39]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[40]  Harish C. Bahl,et al.  A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .

[41]  James R. Evans.  An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing , 1985 .

[42]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[43]  Stéphane Dauzère-Pérès,et al.  Single item lot sizing problems , 2006, Eur. J. Oper. Res..

[44]  B. Fleischmann.  The discrete lot-sizing and scheduling problem , 1990 .

[45]  José Juan Carreño.  Economic Lot Scheduling for Multiple Products on Parallel Identical Processors , 1990 .

[46]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[47]  L. V. Wassenhove,et al.  Multilevel capacitated lotsizing complexity and LP-based heuristics , 1991 .