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

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 evalu...

Full description

Saved in:
Bibliographic Details
Published in2012 International Conference on Computer Science and Service System pp. 94 - 97
Main Authors Sun Liang, Wang Xiao-Yuan, Zhang Yun-Cai
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2012
Subjects
Algorithm design and analysis
Genetic algorithms
Heuristic algorithms
Heuristics algorithm
Job shop scheduling
job-shop scheduling problem
Optimization
Processor scheduling
scheduling theory
Online AccessGet full text
ISBN9781467307215
1467307211
DOI10.1109/CSSS.2012.32

Cover

More Information
Summary: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 job shop problems and proposals for the future research work are summarized and presented respectively.
ISBN:9781467307215
1467307211
DOI:10.1109/CSSS.2012.32