A Client/Server Based Parallel Genetic Algorithm for Parallel Machines Scheduling Problem with Penalties

2012 ◽  
Vol 6 (1) ◽  
pp. 538-541
Author(s):  
Shicheng Hu ◽  
Yongdong Xu ◽  
Yang Liu ◽  
Hong He ◽  
Xiaoping Li
Keyword(s):  
Genetic Algorithm ◽  
Parallel Machines ◽  
Scheduling Problem ◽  
Parallel Genetic Algorithm ◽  
Client Server ◽  
Parallel Machines Scheduling

Fuzzy Parallel Machines Scheduling Problem Based on Genetic Algorithm

2011 ◽  
Vol 204-210 ◽  
pp. 856-861
Author(s):  
Yuan Xie
Keyword(s):  
Genetic Algorithm ◽  
Parallel Machines ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Due Dates ◽  
Nsga Ii ◽  
Optimal Solution Set ◽  
Parallel Machines Scheduling ◽  
Nondominated Sorting ◽  
Completion Times

A kind of unrelated parallel machines scheduling problem is discussed. The memberships of fuzzy due dates denote the grades of satisfaction with respect to completion times with jobs. Objectives of scheduling are to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Two kind of genetic algorithms are employed to search optimal solution set of the problem. Both Niched Pareto Genetic Algorithm (NPGA) and Nondominated Sorting Genetic Algorithm (NSGA-II) can find the Pareto optimal solutions. Numerical simulation illustrates that NSGA-II has better results than NPGA.

Sign in / Sign up

Export Citation Format

Share Document