Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach

European Journal of Operational Research

Volumn 169, Issue 3, 2006, Pages 801-815

  Agarwal, Anurag ^a   Colak, Selcuk ^a   Eryarsoy, Enes ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Adaptive learning; Flow shop; Heuristics; Neural networks; Scheduling

Indexed keywords

ADAPTIVE SYSTEMS; HEURISTIC METHODS; LEARNING SYSTEMS; NEURAL NETWORKS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SCHEDULING;

ADAPTIVE LEARNING; FLOW-SHOPS; IMPROVEMENT-HEURISTIC APPROACH; RANDOM PERTURBATION;

MACHINE SHOPS;

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

References (30)

1. K.R. Baker Introduction to sequencing and scheduling 1974 Wiley Publishing New York
2. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n-job, m-machine scheduling problem Management Science 16 1970 630 637
3. J. Carlier Ordonnancements a contraintes disjonctives Recherche operationelle/Operations Research 12 1978 333 351
4. C.L. Chen, S.V. Venkateswara, and N. Aljaber An application of genetic algorithms for flow shop problems European Journal of Operational Research 80 1995 389 396
5. B.M. Daya, and M. Al-Fawzan A tabu search approach for the flow shop scheduling problem European Journal of Operational Research 109 1998 88 95
6. J.M. Framinan, R. Leisten, and C. Rajendran Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem International Journal of Production Research 41 1 2003 121 148
7. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and job shop scheduling Mathematics of Operations Research 1 1976 117 129
8. B. Goldengorin, G.A. Tijssen, D. Ghosh, and G. Sierksma A data correcting algorithm for the simple plant location problem Journal of Global Optimization 25 4 2003 377 406
9. Grabowski, J., Wodecki, M., 2002. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Research Report PRE 64/2002, Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland.
10. J.N.D. Gupta A functional heuristic algorithm for the flow shop scheduling problem Operational Research Quarterly 22 1971 39 47
11. J.N.D. Gupta An improved lexicographic search algorithm for the flow shop scheduling problem Computers and Operational Research 6 2 1979 117 120
12. J.N.D. Gupta, and W.P. Darrow The two-machine sequence dependent flow shop scheduling problem European Journal of Operational Research 24 3 1986 439 446
13. J. Heller Some numerical experiments for an M × J flow shop and its decision theoretical aspects Operations Research 8 1960 178 184
14. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
15. M.E. Kurz, and R.G. Askin A note on an adaptable problem-space-based search method for flexible flow line scheduling IIE Transactions 33 8 2001 691 693
16. V.J. Leon, and B. Ramamoorthy An adaptable problem-space-based search method for flexible flow line scheduling IIE Transactions 29 2 1997 115 125
17. Z.A. Lomincki A branch and bound algorithm for the exact solution of the three-machine scheduling problem Operational Research Quarterly 16 1965 89 100
18. M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flow shop sequencing problem OMEGA: International Journal of Management Science 11 1983 91 95
19. E. Nowicki, and C. Smutnicki A fast tabu search algorithm for the flow shop problem European Journal of Operational Research 91 1996 160 175
20. max flow shop problem Computers and Operations Research 17 3 1990 243 253
21. I.H. Osman, and C.N. Potts Simulated annealing for permutation flow-shop scheduling OMEGA International Journal of Management Science 17 6 1989 551 557
22. D.S. Palmer Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum Operational Research Quarterly 16 1965 101 107
23. S.G. Ponnambalan, P. Aravindan, and S. Chandrasekaran Constructive and improvement flow shop scheduling heuristics: An extensive evaluation Production Planning and Control 12 4 2003 335 344
24. C. Rajendran, and D. Chaudhuri Heuristic algorithm for scheduling in a flow shop to minimize total flowtime International Journal of Production Economics 29 1993 65 73
25. C.R. Reeves A genetic algorithm for flow shop sequencing Computers Operations Research 22 1995 5 11
26. C.R. Reeves, and T. Yamada Genetic algorithms, path relinking, and flow shop problem Evolutionary Computation 6 1998 45 60
27. E. Taillard Some efficient heuristic methods for the flow shop sequencing problem European Journal of Operational Research 47 1990 65 74
28. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
29. Wolpert, D.H., Macready, W.G., 1995. No free lunch theorems for search, Technical Report, SFI-TR-95-02-010, Santa Fe Institue.
30. K.C. Ying, and C.J. Liao An ant-colony system for permutation flow shop sequencing Computers and Operations Research 31 5 2004 791 801