Paper Info
Title
An efficient search method for multi-objective flexible job shop scheduling problems
Abstract
Flexible job shop scheduling is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches. Motivated by some empirical knowledge, we propose an efficient search method for the multi-objective flexible job shop scheduling problems in this paper. Through the work presented in this work, we hope to move a step closer to the ultimate vision of an automated system for generating optimal or near-optimal production schedules. The final experimental results have shown that the proposed algorithm is a feasible and effective approach for the multi-objective flexible job shop scheduling problems.
Year
DOI
Venue
2009
10.1007/s10845-008-0216-z
J. Intelligent Manufacturing
Keywords
Field
DocType
Combinatorial optimization,Local search,Flexible jobshop scheduling,Multi-objective optimization,Production schedules
Lottery scheduling,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Two-level scheduling,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling
Journal
Volume
Issue
ISSN
20
3
15728145
Citations 
PageRank 
References 
31
1.17
29
Authors
3
Name
Order
Citations
PageRank
Li-Ning Xing1462.66
Ying-wu Chen222716.61
Ke-wei Yang319322.65