By Topic

Tabu Search for Parallel Machine Scheduling with Job Splitting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Celik, C. ; Ind. Eng. Dept., Eskisehir Osmangazi Univ., Eskisehir ; Saricicek, I.

In this paper, we focus on the problem of scheduling on m identical parallel machines with job splitting property. It is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. The problem is solved by a tabu search algorithm. The performance of the algorithm is tested on random generated problems with different sizes. The results are compared with those of the mathematical model. Results of the experiments show that the suggested Tabu Search algorithm gives better solutions to the problems in a reasonable amount of computation time.

Published in:

Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on

Date of Conference:

27-29 April 2009