Minimizing Makespan on Identical Parallel Machines Using Neural Networks

This paper deals with the problem of minimizing the maximum completion time (makespan) of jobs on identical parallel machines. A Hopfield type dynamical neural network is proposed for solving the problem which is known to be NP-hard even for the case of two machines. A penalty function approach is e...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Akyol, Derya Eren, Bayhan, G. Mirac
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Computer systems and distributed systems. User interface Connectionism. Neural networks Energy Function Exact sciences and technology Initialization Scheme Penalty Parameter Schedule Problem Software Travelling Salesman Problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!