New upper bounds for the permutation flowshop scheduling problem

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

Volumn 3533 LNAI, Issue , 2005, Pages 232-235

  Jȩdrzejowicz, Joanna ^a   Jȩdrzejowicz, Piotr ^b  

^a UNIVERSITY OF GDA SK   (Poland)

^b GDYNIA MARITIME UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANNEALING; BENCHMARKING; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; POPULATION STATISTICS; PROBLEM SOLVING;

PERMUTATION FLOWSHOP SCHEDULING PROBLEM; PERMUTATION FLOWSHOP SCHEDULING PROBLEM (PFSP); POPULATION LEARNING ALGORITHM (PLA); STANDARD BENCHMARK DATASET;

ARTIFICIAL INTELLIGENCE;

EID: 26944480382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (3)

1. Jȩdrzejowicz P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems, Foundation of Computing and Decision Sciences, 24 (1999) 51-66
2. Jedrzejowicz, J., Jedrzejowicz, P.: PLA-Based Permutation Scheduling, Foundations of Computing and Decision Sciences 28(3) (2003) 159-177
3. Ruiz, R., Maroto, C., Alcaraz, J.: New Genetic Algorithms for the Permutation Flowshop Scheduling Problems, Proc. The Fifth Metaheuristic International Conference, Kyoto, 2003, 63-1-63-8