Capacitated lot sizing with setup times
Citations
3,572 citations
670 citations
Cites background or methods from "Capacitated lot sizing with setup t..."
...[53] remark that the set-partitioning approaches tend to under account for the setup costs and times, because these are charged only once when a lot is split....
[...]
...The LP relaxation of this problem Table 3 Summary of mathematical based heuristics Algorithm Methods used in algorithm Newson [48] Lagrangian relaxation, shortest path, Wagner–Whitin Thizy and Van Wassenhove [50] Lagrangian relaxation, transportation, Wagner–Whitin, subgradient optimisation Billington et al. [49] Lagrangian relaxation, transportation, Wagner–Whitin, subgradient optimisation Trigeiro [52] Lagrangian relaxation, Wagner–Whitin, subgradient optimisation, smoothing Trigeiro et al. [53] Lagrangian relaxation, transportation, Wagner–Whitin, subgradient optimisation Diaby et al. [58] Lagrangian relaxation, transportation, Wagner–Whitin, subgradient optimisation Bitran and Matsuo [51] Various relaxations Millar and Yang [56] Network formulation, Lagrangian relaxation, Lagrangian decomposition Chen and Thizy [31] Relaxation methods Thizy [54] Lagrangian decomposition Gelders et al. [57] Branch and bound, Lagrangian relaxation Diaby et al. [58] Branch and bound, Lagrangian relaxation, subgradient optimisation Hindi [61] Branch and bound, shortest path, column generation, minimum cost network Tow Armentano et al. [62] Branch and bound, minimum cost network Tow Chung et al. [59] Branch and bound, dynamic programming LotD and Yoon [60] Branch and bound Manne [63] Set partitioning, linear programming Cattrysse et al. [64] Set partitioning, column generation Lozano et al. [65] Primal–dual, relaxation Hindi [66] Tabu search, transshipment Hindi [67] Shortest path, column generation, minimum cost network Tow, tabu search Hung and Hu [68] Shadow prices is then solved by column generation....
[...]
...Trigeiro [47] developed a heuristic algorithm for CLSP with setup times....
[...]
...Trigeiro used a feedback mechanism for ensuring feasibility....
[...]
...The problems solved are from various families including big-bucket and small-bucket variants of sizes up Table 1 Summary of CLSP algorithms Barany et al. [33] Exact methods Methods for solving CLSP Eppen and Martin [34] Leung et al. [35] Belvaux and Wolsey [36] Belvaux and Wolsey [37] Fatemi Ghomi and Hashemin [38] Eisenhut [39] Period-by-period Common-sense Lambrecht and Vanderveken [40] heuristics or Dixon and Silver [41] specialised Maes and Van Wassenhove [42] heuristics Kirca and Kokten [15] Dogramaci et al. [43] Improvement Karni and Roll [44] heuristics Gunther [45] Selen and Heuts [46] Trigeiro [47] Newson [48] Relaxation Mathematical Billington et al. [49] heuristics Programming Thizy and Van Wassenhove [50] Based Bitran and Matsuo [51] Heuristics Trigeiro [52] Trigeiro et al. [53] Chen and Thizy [31] Thizy [54] Diaby et al. [55] Millar and Yang [56] Gelders et al. [57] Branch-and-bound Diaby et al. [58] heuristics Chung et al. [59] LotD and Yoon [60] Hindi [61] Armentano et al. [62] Manne [63] Set partitioning and Cattrysse et al. [64] column generation heuristics Lozano et al. [65] Other heuristics Hindi [66] Hindi [67] Hung and Hu [68] to 10 machines, up to 20 items and up to three periods....
[...]
556 citations
350 citations
References
42,654 citations
40,020 citations
2,281 citations
2,114 citations
1,339 citations