Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of Heuristics

Volumn 10, Issue 1, 2004, Pages 89-104

  Della Croce, F ^a   Ghirardi, M ^a   Tadei, R ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Heuristics; Location; Recovering beam search; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

BEAM SEARCH (BS) APPROACH; COMBINATORIAL OPTIMIZATION (CO); HEURISTICS; RECOVERING BEAM SEARCH;

COMBINATORIAL MATHEMATICS;

EID: 2142657295     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000019987.10818.e0     Document Type: Article

References (20)

1. Avella, P. and A. Sforza. (1999). "Logical Reduction Tests for the p-Median Problem." Annals of Operations Research 86, 105-115.
2. Beasley, I.E. (1993). "Lagrangean Heuristics for Location Problems." European Journal of Operational Research 65, 383-399.
3. Christofides, N. and J.E. Beasley. (1982). "A Tree Search Algorithm for the p-Median Problem." European Journal of Operational Research 10, 196-204.
4. Conway, R.W., W.L. Maxwell, and L.W. Miller. (1967). Theory of Scheduling. Reading, MA: Addison-Wesley.
5. Della Croce, F. (1995). "Generalized Pairwise Interchanges and Machine Scheduling." European Journal of Operational Research 83, 310-319.
6. Della Croce, F., M. Ghirardi, and R. Tadei. (2002). "An Improved Branch and Bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem." European Journal of Operational Research 139, 293-301.
7. Della Croce, F., V. Narayan, and R. Tadei. (1996). "The Two Machine Total Completion Time Flow Shop Problem." European Journal of Operational Research 90, 227-237.
8. Della Croce, F. and V. T'kindt. (2002). "A Recovering Beam Search Procedure for the Single Machine Dynamic Total Completion Time Scheduling Problem." Journal of the Operational Research Society 53, 1275-1280.
9. Garey, M.R., D.S. Johnson, and R. Sethi. (1979). "The Complexity of Flowshop and Jobshop Scheduling." Mathematics of Operations Research 1, 117-129.
10. Hakimi, S.L. (1964). "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph." Operations Research 12, 450-459.
11. Hanjoul, P. and D. Peeters. (1985). "A Comparison of Two Dual-Based Procedures for Solving the p-Median Problem." European Journal of Operational Research 20, 387-396.
12. Hansen, P. and N. Mladenovtć. (1997). "Variable Neighborhood Search for the p-Median." Location Science 5, 207-226.
13. Hansen, P. and N. Mladenović. (2001). "Variable Neighborhood Decomposition Search." Journal of Heuristics 7(4), 335-350.
14. Kariv, O. and S.L. Hakimi. (1979). "An Algorithmic Approach to Network Location Problems; Part 2. The p-Medians." SIAM Journal on Applied Mathematics 37, 539-560.
15. Ow, P.S. and T.E. Morton. (1988). "Filtered Beam Search in Scheduling." International Journal of Production Research 26, 297-307.
16. Ow, P.S. and T.E. Morton. (1989). "The Single Machine Early-Tardy Problem." Management Science 35, 177-191.
17. Reinelt, G. (1991). "A Traveling Salesman Problem Library." ORSA Journal on Computing 3, 376-384.
18. Szwarc, W. (1983). "The Flow-Shop Problem with Mean Completion Time Criterion." IIE Transactions 15, 172-176.
19. T'kindt, V., N. Monmarché, D. Laugt, and F. Tercinet. (2002). "An Ant Colony Optimization Algorithm to Solve a 2-Machine Bicriteria Flowshop Scheduling Problem." European Journal of Operational Research 142, 250-257.
20. van de Velde, S.L. (1990). "Minimizing the Sum of Job Completion Times in the Two-Machine How-Shop by Lagrangean Relaxation." Annals of Operations Research 26, 257-268.