TY - JOUR
T1 - Solving job shop scheduling problems utilizing the properties of backbone and "big valley"
AU - Pardalos, Panos M.
AU - Shylo, Oleg V.
AU - Vazacopoulos, Alkis
PY - 2010/9
Y1 - 2010/9
N2 - In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and "big valley" properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.
AB - In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and "big valley" properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.
KW - Backbone
KW - Big valley
KW - Job shop scheduling problem
KW - Makespan
KW - Metaheuristic
UR - http://www.scopus.com/inward/record.url?scp=77956769460&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956769460&partnerID=8YFLogxK
U2 - 10.1007/s10589-008-9206-5
DO - 10.1007/s10589-008-9206-5
M3 - Article
AN - SCOPUS:77956769460
SN - 0926-6003
VL - 47
SP - 61
EP - 76
JO - Computational Optimization and Applications
JF - Computational Optimization and Applications
IS - 1
ER -