Your browser does not support JavaScript!

Αρχική    Αλγόριθμοι τοπικής Αναζήτησης με Απαγόρευση Κινήσεων και Παραλληλοποίηση της Αναζήτησης για την Επίλυση του Προβλήματος Ροϊκής Παραγωγής  

Αποτελέσματα - Λεπτομέρειες

Προσθήκη στο καλάθι
[Προσθήκη στο καλάθι]
Κωδικός Πόρου uch.csd.msc//1995papadakis
Τίτλος Αλγόριθμοι τοπικής Αναζήτησης με Απαγόρευση Κινήσεων και Παραλληλοποίηση της Αναζήτησης για την Επίλυση του Προβλήματος Ροϊκής Παραγωγής
Άλλος τίτλος Parallel Tabu Search Algorithms for the Flow-Shop Problem
Συγγραφέας Παπαδάκης, Δημήτρης
Συντελεστής Π. Κωνσταντόπουλος
Περίληψη During the last decades, the flowshop sequencing problem has held the attention of many researchers. The flowshop sequencing problem is a production scheduling problem in which each one of N jobs must be processed in the same sequence on each one of M machines. Since Johnson proposed optimal two and three-stage production schedules, many heuristics have been suggested to solve this problem. Complete enumeration, branch and bound techniques or integer programming determine the optimal sequence for very small problems, but efficient heuristics are necessary in order to solve larger ones. In this thesis two cases of the flowshop problem were dealt with. In the first case the objective was to minimize the maximum completion time of the jobs C_max, whereas in the second case each job was assigned a due date and the objective was to minimize primarily the maximum tardiness and secondary the maximum completion time of the jobs. The computational complexity of the flowshop sequencing problem does not allow the development of computationally fast algorithms which could optimally solve it. In this thesis taboo search techniques were studied and heuristic algorithms were developed to suboptimally solve the flowshop sequencing problem. Taboo search is a simple and flexible method for obtaining good solutions quickly and has been successfully applied to NP-complete problems such as the flowshop problem. The efficience of the method depends on the size of neighborhoods in the search space which are iteratively examined in order to obtain local optimums. In case that the optimum in a neighborhood is not unique the method can not determine the best path to continue the search. To overcome the weaknesses of taboo search, a pruning path mechanism was developed which proved effective for both the problems of flowshop that were studied. In the case of the flowshop problem with the unique criteria of minimizing the maximum completion time of the jobs, a tree search technique was developed which allows the evaluation of equivalent search paths. Finally, the process of taboo search was parallelized which drastically improved its running time.
Θέμα Παράλληλα και Κατανεμημένα Συστήματα
Ημερομηνία έκδοσης 1995-11-01
Ημερομηνία διάθεσης 1997-06-2
Συλλογή   Σχολή/Τμήμα--Σχολή Θετικών και Τεχνολογικών Επιστημών--Τμήμα Επιστήμης Υπολογιστών--Μεταπτυχιακές εργασίες ειδίκευσης
  Τύπος Εργασίας--Μεταπτυχιακές εργασίες ειδίκευσης
Εμφανίσεις 351

Ψηφιακά τεκμήρια
No preview available

Κατέβασμα Εγγράφου
Προβολή Εγγράφου
Εμφανίσεις : 4

No preview available

Προβολή Εγγράφου