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

Author

Liang, Sun ; Xiao-yuan, Wang ; Yun-cai, Zhang

fYear

2012

fDate

11-13 Aug. 2012

Firstpage

94

Lastpage

97

Abstract

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.

Keywords

cost reduction; inventory management; job shop scheduling; product life cycle management; JSSP problem; competive pressure; consumer demand; costs reduction; critical element analysis; efficiency evaluation; heuristics algorithms; job-shop scheduling problem; manufacture enterprise; productive efficiencies; shorter product life cycle; zero inventory system; Algorithm design and analysis; Genetic algorithms; Heuristic algorithms; Job shop scheduling; Optimization; Processor scheduling; Heuristics algorithm; job-shop scheduling problem; scheduling theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science & Service System (CSSS), 2012 International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4673-0721-5

Type

conf

DOI

10.1109/CSSS.2012.32

Filename

6394270