Research on Coarse-grained Parallel Genetic Algorithm Based Grid Job Scheduling

Zhang, Huifu; Chen, Ran

doi:10.1109/skg.2008.29

Search citation statements

Order By: Relevance

Paper Sections

Select...

Afinding Solution Of Jssp Using a Heuristics Algorithms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2012

Publication Types

Select...

Other1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aydin adopted SA(simulated annealing) algorithm to find solutions for JSSP [6]. H. Zhang et al managed to generate optimal schedules using an coarse-grained parallel genetic algorithm [7]. Dellaert N solve the general multilevel lotsizing problem with time-varying costs using genetic algorithms [8].…”

Section: Afinding Solution Of Jssp Using a Heuristics Algorithmsmentioning

confidence: 99%

Heuristics Algorithms for Job-Shop Scheduling Problem: Critical Element Analysis

Sun

Wang

Yun-Cai

2012

2012 International Conference on Computer Science and Service System

View full text Add to dashboard Cite

Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing algorithms for solving problem of JSSP problem become an important issue. Moreover, it is difficult to find an appropriate criteria to evaluate efficiency of algorithms available with respect to solving JSSP . Various algorithms for solving JSSP are listed , and their advantages and disadvantages are also indicated. At the same time, three critical element for designing algorithms for JSSP were proposed. Finally , several future research trends of solving jobshop problems and proposals for the future research work are summarized and presented respectively.

show abstract

Section: Afinding Solution Of Jssp Using a Heuristics Algorithmsmentioning

confidence: 99%