Parallel genetic algorithm for minimizing total weighted completion time

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

Volumn 3070, Issue , 2004, Pages 400-405

  Bozejko, Wojciech ^a   Wodecki, Mieczysław ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; OPTIMIZATION; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; JOB SCHEDULING; MULTIPROCESSORS;

SCHEDULING;

EID: 9444225978     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24844-6_58     Document Type: Conference Paper

References (9)

1. Bensal S.: Schingle machine scheduling to minimize weighted sum of completion times with secondary criterion - a branch and bound approach. European J. Oper. Res. 5 (1980) 177-181
2. Goldberg D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., Massachusetts (1989)
3. Holland J.H.: Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press (1975)
4. Lenstra J.J., Rinnoy Kan A.H.G., Brucker P.: Complexity of machine scheduling problems. Ann. Discrete Math. (1979) 287-326
5. Pan Y.: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time, Operation Research Letters 31 (2003) 492-496
6. Posner M.: Minimizing weighted completion times with deadlines, Oper. Res. 33 (1985) 562-574
7. Rinnoy Kan A.G.H, Lageweg B.J., Lenstra J.K.: Minimizing total cost one-machine scheduling. Operations Research 26 (1975) 908-972
8. Smith W.E.: Various optimizers for single-stage production, Naval Res. Logist. Quart. 3 (1956) 59-66
9. Wodecki M., Bozejko W., Solving the now shop problem by parallel simulated annealing, LNCS No. 2328, Springer Verlag (2002) 236-247