A multi-level hybrid framework applied to the general flow-shop scheduling problem

Computers and Operations Research

Volumn 29, Issue 13, 2002, Pages 1873-1901

  Jain, Anant Singh ^a   Meeran, Sheik ^b  

^a i2 Technologies   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Flow shop scheduling; Intensification and diversification; Multi level hybrid system; Tabu search

Indexed keywords

COMPUTER AIDED MANUFACTURING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FLOW-SHOPS;

OPERATIONS RESEARCH;

OPTIMIZATION;

MANAGEMENT; ONLINE MONITORING; QUALITY CONTROL; SCATTER SEARCH TECHNIQUE; WORK SCHEDULE;

EID: 0036833015     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00064-8     Document Type: Article

References (49)

1. The lessons of flow shop scheduling research
2. A heuristic algorithm for the n job m machine sequencing problem
3. An evaluation of flow shop sequencing heuristics
4. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem
5. A new heuristic method for the flow sequencing problem
6. Some efficient heuristic methods for the flow shop sequencing problem
7. A new heuristic for the n-job M-machine flow-shop problem
8. A genetic algorithm for flowshop sequencing
9. Two branch and bound algorithms for the permutation flow shop problem
10. A fast tabu search algorithm for the permutation flow-shop problem
11. Permutation flowshop scheduling by genetic local search
12. Genetic algorithms, path relinking and the flowshop sequencing problem
13. General scheduling algorithms with applications to parallel scheduling and multiprogramming scheduling
14. Heurisitic programming solution of a flow shop scheduling problem
15. Machine aggregation heuristics in shop-scheduling
16. Permutation vs. non-permutation flow shop schedules
17. Deterministic job-shop scheduling; past, present and future
18. Parallel taboo search techniques for the job-shop scheduling problem
19. Some numerical experiments for an M x J flow shop and its decision-theoretical aspects
20. Optimal two- and three-stage production schedules with set-up times included
21. A fast taboo search algorithm for the job-shop problem
22. A computational study of shifting bottleneck procedures for shop scheduling problems
23. New and "stronger" job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
24. Heuristics for integer programming using surrogate constraints
25. Solving the job shop scheduling problem using tabu search
26. A template for scatter search and path relinking
27. Insertion techniques for the heuristic solution of the job-shop problem
28. Sequential and parallel local search algorithms for job shop scheduling
29. The one-machine sequencing problem
30. Tabu search for nonlinear and parametric optimisation (with links to genetic algorithms)
31. Some new results on simulated annealing applied to the job shop scheduling problem
32. Solving resource-constrained network problems by implicit enumeration: Non preemptive case
33. Job shop scheduling by simulated annealing
34. A controlled search simulated annealing method for the general job-shop scheduling problem
35. Job shop scheduling by local search
36. Performance of various computers using standard linear equations software
37. Ordonnancements à contraintes disjonctives
38. Benchmarks for basic scheduling problems
39. Benchmarks for shop scheduling problems
40. Job-shop scheduling by simulated annealing combined with deterministic local search
41. Optimisation by ghost image processes in neural networks