Population-based approach to multiprocessor task scheduling in multistage hybrid flowshops

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2773 PART 1, Issue , 2003, Pages 279-286

  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

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; LEARNING ALGORITHMS; PROBLEM SOLVING; SCHEDULING; BENCHMARKING; DISTRIBUTED COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; MULTITASKING; SCHEDULING ALGORITHMS;

INFORMATION EXCHANGE; MULTIPROCESSOR TASK SCHEDULING; MULTISTAGE HYBRID FLOWSHOPS; POPULATION LEARNING ALGORITHM;

MULTIPROCESSING SYSTEMS; KNOWLEDGE BASED SYSTEMS;

COMPUTATIONAL EXPERIMENT; HYBRID FLOW SHOP; LOCAL SEARCH; MULTIPROCESSOR TASK SCHEDULING; POPULATION LEARNING ALGORITHMS; UPPER BOUND;

EID: 8344223707     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Blazewicz J., M. Drozdowski, J. Wȩglarz: Scheduling independent 2-processor tasks to minimize schedule length, Information Processing Letters, 18 (1984) 267-273
2. Blazewicz J., M. Drozdowski, J. Wȩglarz: Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, C-35(1986) 81-96
3. Blazewicz J., K.H.Ecker, E.Pesch, G.Schmidt, J.Wȩglarz: Scheduling Computer and Manufacturing Processes, Springer, Berlin (1996)
4. Lloyd E. L.: Concurrent task systems, Operations Research, 29 (1981) 189-201
5. Brucker P., B. Kramer: Shop Scheduling Problems with multiprocessor tasks on dedicated processors, Annals of Operations Research, 50 (1995) 13-27
6. Feo T. A., M. G. C. Resende: A probabilistic heuristic for computationally difficult set covering problems, Operations Research Letters, 8 (1989) 706-712
7. 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
8. Jȩdrzejowicz J., P. Jȩdrzejowicz: Permutation Scheduling Using Population Learning Algorithm, in: Knowledge-based Intelligent Information Engineering Systems and Allied Technologies, E.Damiani et al. (Eds.), IOS Press, Amsterdam (2002) 93-97
9. Moscato P.: Memetic Algorithms: A short introduction. In: D.Corne, M.Dorigo, F.Glover (Eds.), New Ideas in Optimization, McGraw-Hill, New York (1999) 219-234
10. Oǧuz, C., Y. Zinder, V. Ha Do, A. Janiak, M. Lichtenstein: Hybrid flow-shop scheduling problems with multiprocessor task systems, Working paper, The Hong Kong Polytechnic University, Hong Kong SAR (2001)
11. Reynolds R. G.: An Introduction to Cultural Algorithms. In: A.V. Sebald, L. J. Fogel (Eds.), Proceedings of the Third Annual Conference on Evolutionary Programming, World Scientific, River Edge, (1994) 131-139
12. Sivrikaya-Şerifoǧlu, F., G. Ulusoy: A genetic algorithm for multiprocessor task scheduling in multistage hybrid flowshops, Working paper, Abant Izzet Baysal University, Bolu (2001)