Heuristic Algorithms for Parallel Machine Scheduling Problems with Dividable Jobs

This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. Th...

Full description

Saved in:
Bibliographic Details
Published inIndustrial engineering & management systems : an international journal Vol. 10; no. 1; pp. 15 - 23
Main Authors Tsai, Chi-Yang, Chen, You-Ren
Format Journal Article
LanguageKorean
Published 2011
Subjects
Parallel Machine Scheduling
Simulated Annealing
Genetic Algorithm
Dividable Jobs
Online AccessGet full text

Cover

More Information
Summary:This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.
Bibliography:KISTI1.1003/JNL.JAKO201116450096136
ISSN:1598-7248