A filter-and-fan approach to the job shop scheduling problem

European Journal of Operational Research

Volumn 194, Issue 3, 2009, Pages 650-662

  Rego, César ^a   Duarte, Renato ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b INSTITUTO POLITÉCNICO DE SETÚBAL   (Portugal)

Author keywords

Heuristics; Job shop problem; Local search

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; SOLUTIONS; WAVE FILTERS;

ADAPTIVE NEIGHBORHOODS; BENCHMARK PROBLEMS; COMPUTATIONAL RESULTS; EFFICIENT ALGORITHMS; HEURISTICS; JOB SHOP PROBLEM; JOB-SHOP SCHEDULING PROBLEMS; LOCAL SEARCH; LOCAL SEARCH PROCEDURES; METAHEURISTIC ALGORITHMS; OPTIMAL SOLUTIONS; SEARCH METHODS; SHIFTING BOTTLENECK PROCEDURES; STARTING SOLUTIONS; TREE SEARCHES;

HEURISTIC ALGORITHMS;

EID: 55149108060     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.12.035     Document Type: Article

References (36)

1. Van Laarhoven P., Aarts E., and Lenstra J. Job shop scheduling by simulated annealing. Operations Research 40 (1992) 113-125
2. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
3. Applegate D., and Cook W. A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3 2 (1991) 149-156
4. Balas E., and Vazacopoulos A. Guided local search with shifting bottleneck for job shop scheduling. Management Science 44 2 (1998) 262-275
5. Cavique L., Rego C., and Themido I. Subgraph ejection chains and tabu search for the crew scheduling problem. Journal of the Operational Research Society 50 (1999) 608-616
6. Fisher H., and Thompson G.L. Probabilistic learning combinations of local job shop scheduling rules. In: Muth J.F., and Thompson G.L. (Eds). Industrial Scheduling (1963), Prentice Hall, Englewood Cliffs, New Jersey, USA 225-251
7. Rego C., Li H., and Glover F. A filter-and-fan approach to the 2D HP model of the protein folding problem, school of business administration (2006), University of Mississippi
8. Gamboa D., Rego C., and Glover F. Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers and Operations Research 33 (2006) 1161-1179
9. Glover F. A template for scatter search and path relinking. In: Hao J.K., Lutton E., Ronald E., Schoenauer M., and Snyers D. (Eds). Artificial Evolution. Lecture Notes in Computer Science vol. 1363 (1998), Springer, Heidelberg 13-54
10. Grabowski J., and Wodecki M. A very fast tabu search algorithm for job shop problem. In: Rego C., and Alidaee B. (Eds). Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (2005), Kluwer Academic Publishers, Boston 191-211
11. Greistorfer P., and Rego C. A simple filter and fan approach to the facility location problem. Computers and Operations Research 33 9 (2006) 2590-2601
12. Lawrence S. Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Graduate School of Industrial Administration (1984), Carnegie-Mellon University, Pittsburgh, USA
13. Lin S., and Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
14. B.T. Lowerre, The HARPY Speech Recognition System, Ph.D. thesis, Carnegie-Mellon University, USA, 1976.
15. Nowichi E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
16. Rego C. Relaxed tours and path ejection chains for the traveling salesman problem. European Journal of Operational Research 106 (1998) 522-538
17. Rego C. A subpath ejection method for the vehicle routing problem. Management Science 44 (1998) 1447-1459
18. Rego C. Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Computing 27 (2001) 201-222
19. Rego C., and Glover F. Local search and metaheuristics for the traveling salesman problem. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and its Variations. Combinatorial Optimization Series vol. 12 (2002), Kluwer Academic Publishers 309-368
20. Sabuncuoglu I., and Bayiz M. Job shop scheduling with beam search. European Journal of Operational Research 118 (1999) 390-412
21. Vaessens R.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by local search. INFORMS Journal on Computing 8 3 (1996) 302-317
22. Yagiura M., Ibaraki T., and Glover F. An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing 16 (2004) 133-151
23. Gonçalves J.F., Mendes J.J.M., and Resende M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167 (2005) 77-95
24. Pinedo M.L. Planning and Scheduling in Manufacturing and Services. Series in Operations Research and Financial Engineering (2006), Springer-Verlag
25. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 (1988) 35-62
26. Della Croce F., and T'kindt V. A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society 53 (2002) 1275-1280
27. Blackstone J., Phillips D., and Hogg G. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 20 1 (1982) 27-45
28. Balas E. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research 17 (1969) 1-10
29. Carlier J., and Pinson E. An algorithm for solving the job-shop problem. Management Science 35 2 (1989) 164-176
30. Gary M.R., and Johnson D.S. Computer and intractability: a guide to the theory of NP-completeness (1979), Freeman
31. W.P.M. Nuijten, E.H.L. Aarts, D.A.A. van Erp Taalman Kip, K.M. van Hee, Randomized Constraint Satisfaction for Job Shop Scheduling, in: Proceedings of IJCAI'93 Workshop on Knowledge-Based Production Planning, Scheduling and Control, 1993, pp. 251-262.
32. Nuijten W.P.M., and Aarts E.H.L. A computational study of constraint satisfaction for multiple capacitated job-shop scheduling. European Journal of Operational Research 90 (1996) 269-284
33. Glover F., and McMillan C. The general employee scheduling problem: an integration of management science and artificial intelligence. Computers and Operations Research 13 4 (1986) 563-593
34. Ivens P., and Lambrecht M. Extending the shifting bottleneck procedure to real-life applications. European Journal of Operational Research 90 (1996) 252-268
35. Chang Y.-L., Matsuo H., and Sullivan R.S. A bottleneck-based beam search for job scheduling in a flexible manufacturing system. International Journal of Production Research 27 11 (1989) 1949-1961
36. S. Rubin, The ARGOS Image Understanding System, Ph.D. Dissertation, Carnegie-Mellon University, April, 1978.