Genetic algorithms for flowshop scheduling problems

Computers and Industrial Engineering

Volumn 30, Issue 4, 1996, Pages 1061-1071

  Murata, Tadahiko ^a   Ishibuchi, Hisao ^a   Tanaka, Hideo ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

FLOWSHOP SCHEDULING PROBLEMS; GENETIC OPERATORS; HYBRID GENETIC ALGORITHMS;

GENETIC ALGORITHMS;

EID: 0030241443     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(96)00053-8     Document Type: Article

References (19)

1. S. M. Johnson. Optimal two-and three-stage production schedules with setup times included. Naval Res. Logistics Q. 1, 61-68 (1954).
2. I. H. Osman and C. N. Potts. Simulated annealing for permutation flow-shop scheduling. OMEGA 17, 551-557 (1989).
3. M. Widmer and A. Hertz. A new heuristic method for the flowshop sequencing problem. Europ. J. Opnl Res. 41, 186-193 (1990).
4. E. Taillard. Some efficient heuristic methods for the flowshop sequencing problem. Europ. J. Opnl Res. 47, 65-74 (1990).
5. J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975).
6. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989).
7. L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991).
8. P. Jog, J. Y. Suh and D. V. Gucht. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. Proc. of the Third ICGA, 110-115 (1989).
9. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley. A comparison of genetic sequencing operators. Proc. of the Fourth ICGA, 69-76 (1991).
10. N. L. J. Ulder, E. H. L. Aarts, H.-J. Bandelt, P. J. M. van Laarhoven and E. Pesch. Genetic local search algorithms for the traveling salesman problem. In Parallel Problem Solving from Nature (Edited by H.-P. Schwefel and R. Manner), pp. 109-116. Springer, Berlin (1991).
11. B. R. Fox and M. B. McMahon. Genetic operations for sequencing problems. In Foundations of Genetic Algorithms (Edited by G. J. E. Rawlins), pp. 284-300. Morgan Kaufmann Publishers, San Mateo (1991).
12. C. A. Glass, C. N. Potts and P. Shade. Genetic algorithms and neighborhood search for scheduling unrelated parallel machines. Preprint series, No. OR47, University of Southampton (1992).
13. H. Ishibuchi, N. Yamamoto, T. Murata and H. Tanaka. Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems. Fuzzy Sets and Systems 67, 81-100 (1994).
14. B. Manderick and P. Spiessens. How to select genetic operators for combinatorial optimization problems by analyzing their fitness landscape. Computational Intelligence Imitating Life, pp. 170-181. IEEE Press, New York (1994).
15. G. Syswerda. Scheduling optimization using genetic algorithms. In Handbook of Genetic Algorithms (Edited by L. Davis), pp. 332-349. Van Nostrand Reinhold, New York (1991).
16. R. A. Dudek, S. S. Panwalkar and M. L. Smith. The lessons of flowshop scheduling research. Ops Res. 40, 7-13 (1992).
17. D. Whitley, T. Starkweather and D. Fuquay. Scheduling problems and traveling salesmen: the genetic edge recombination operator. Proc. of the Third ICGA, 133-140 (1989).
18. I. Oliver, D. Smith and J. Holland. A study of permutation crossover operators on the traveling salesman problem. Proc. of the Second ICGA, 224-230 (1987).
19. H. Ishibuchi, S. Misaki and H. Tanaka. Modified simulated annealing algorithms for the flow shop sequencing problem. Europ. J. Opnl Res. 81, 388-398 (1995).