Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server

Name: Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server
Author: Turker, A K, Sel, C

İsim	Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server
Yazar	Turker, A K, Sel, C
Konu	Algorithms, Approximation, Genetic algorithms, Mathematical analysis, Optimization, Scheduling, Servers, Strings
Tür	Süreli Yayın
Dil	Belirlenmemiş dil
Dijital	Evet
Yazma	Hayır
Kütüphane:	Washington Üniversitesi
Demirbaş Numarası	ISSN: 1303-9709
Kayıt Numarası	cdi_proquest_miscellaneous_869839131
Lokasyon	Check availability & request options
Tarih	Gazi University Journal of Science, 1901-01, Vol.24 (1), p.113-123
Notlar	This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2, S parallel STsd parallel Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2, S parallel STsd parallel Cmax problem.
Örnek Metin	Gazi University Journal of Science, 1901-01, Vol.24 (1), p.113-123

Kaynağa git Washington Üniversitesi University of Washington

Aramaya Dön

Washington Üniversitesi

Kaynağa git

Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server

Yazar Turker, A K, Sel, C

Konu Algorithms, Approximation, Genetic algorithms, Mathematical analysis, Optimization, Scheduling, Servers, Strings

Tür Süreli Yayın

Dil Belirlenmemiş dil

Dijital Evet

Yazma Hayır

Kütüphane Washington Üniversitesi

Demirbaş Numarası ISSN: 1303-9709

Kayıt Numarası cdi_proquest_miscellaneous_869839131

Lokasyon Check availability & request options

Tarih Gazi University Journal of Science, 1901-01, Vol.24 (1), p.113-123

Notlar This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2, S parallel STsd parallel Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2, S parallel STsd parallel Cmax problem.

Örnek Metin Gazi University Journal of Science, 1901-01, Vol.24 (1), p.113-123