Parallel robot scheduling to minimize mean tardiness with precedence constraints using a genetic algorithm

Authors:
Tarık Çakar;Raşit Köker;H. İbrahim Demir
Affiliations:
Sakarya University, Engineering Faculty, Department of Industrial Engineering, 54187 Sakarya, Turkey;Sakarya University, Engineering Faculty, Computer Engineering Department, 54187 Sakarya, Turkey;Sakarya University, Engineering Faculty, Department of Industrial Engineering, 54187 Sakarya, Turkey
Venue:
Advances in Engineering Software
Year:
2008

Citing 2
Cited 4

Weighted-tardiness scheduling on parallel machines with proportional weights

Operations Research
Scheduling parallel machines to minimize total weighted and unweighted tardiness

Computers and Operations Research

Non-identical parallel machine scheduling using genetic algorithm

Expert Systems with Applications: An International Journal
A distribution network optimization problem for third party logistics service providers

Expert Systems with Applications: An International Journal
A genetic algorithm application using fuzzy processing times in non-identical parallel machine scheduling problem

Advances in Engineering Software
A genetic algorithm approach to a neural-network-based inverse kinematics solution of robotic manipulators based on error minimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identical parallel robot scheduling problem for minimizing mean tardiness with precedence constraints is a very important scheduling problem. But, the solution of this problem becomes much difficult when there are a number of robots, jobs and precedence constraints. Genetic algorithm is an efficient tool in the solution of combinatorial optimization problems, as it is well known. In this study, a genetic algorithm is used to schedule jobs that have precedence constraints minimizing the mean tardiness on identical parallel robots. The solutions of problems, which have been taken in different scales, have been done using simulated annealing and genetic algorithm. In particular, genetic algorithm is found noteworthy successful in large-scale problems.