Journal of Computational Physics
Modern heuristic techniques for combinatorial problems
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Genetic Algorithms and Neighbourhood Search
Selected Papers from AISB Workshop on Evolutionary Computing
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Decision Analysis for Management Judgment
Decision Analysis for Management Judgment
Lot sizing and furnace scheduling in small foundries
Computers and Operations Research
Computers and Operations Research
Scheduling production for a sawmill: A comparison of a mathematical model versus a heuristic
Computers and Industrial Engineering
Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The planning of a canning line at a drinks manufacturer is discussed and formulated as a mathematical programming model. Several alternative heuristic solution methods are developed, tested and compared on real data, illustrating the trade-offs between solution quality and computing time. The two most successful methods make hybrid use of local search and integer programming, but in rather different ways. The first method searches for the best proportion by which to factor setup times into unit production times. The second method carries out a local search on the first stage's binary setup variables. In both methods approximate mixed integer programming models are solved at each search iteration. In addition, a local search variant, called diminishing neighbourhood search, is used in order to avoid local optima in a variety of landscapes. Computational tests analyse the quality/time trade-offs between alternative heuristics, enabling an efficient frontier of non-dominated solutions to be identified.