Heuristic rules and genetic algorithms for open shop scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3040, Issue , 2004, Pages 394-403

  Puente, Jorge ^a   Díez, Helio R ^a   Varela, Ramiro ^a   Vela, Camino R ^a   Hidalgo, Luis P ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; CONSTRAINT SATISFACTION PROBLEMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; SCHEDULING; TECHNOLOGY TRANSFER;

DISPATCHING RULES; HEURISTIC RULES; HIGH QUALITY; INITIAL POPULATION; OPEN SHOP SCHEDULING; OPEN SHOP SCHEDULING PROBLEM; OPTIMAL SOLUTIONS; PROBABILISTIC ALGORITHM;

HEURISTIC METHODS;

EID: 7444265400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25945-9_39     Document Type: Conference Paper

References (10)

1. Bierwirth, C. A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum, Vol. 17 (1995) 87-92.
2. Brucker, P., Hurink, J., Jurish, B. and Wostmann, B., A branch and bound algorithm for the open-shop problem, Discrete Applied Mathematics 76 (1997) 43-59.
3. Gonzales, T. and Sahni, S. Open shop scheduling to minimize finish time, Journal of the Association of Computing Machinery 23 (4) (1976) 665-679.
4. Giffler, B. Thomson, G. L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8 (1960) 487-503.
5. Guéret, Ch. and Prins, Ch., Classical and new heuristics for the open-shop problem: A computational study. European Journal of Operational Research 107 (1998) 306-314.
6. Liaw, Ch-F., An iterative improvement approach for the nonpreemtive open shop scheuling problem, European Journal of Operational Research 111 (1998) 509-517.
7. Liaw, Ch-F., A hybrid genetic algorithm for the open shop scheduling problem, European Journal of Operational Research 124 (2000) 28-52.
8. Pinedo, M., Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Enblewoodd Cliffs, NJ. (1995).
9. Taillard, E.: Bechmarks for basic scheduling problems. European Journal of Operational Research, Vol 64 (1993) 278-285.
10. Varela, R., Vela, C. R., Puente, J., Gómez A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research, Vol 145 (2003) 57-71.