An Analysis Of Research In Job Shop Scheduling Problem (2000-2009)
Job shop scheduling problem (JSP) attracted lots of researchers attentions over the past several decades, and developed more rapidly in 21st century due to the development of computer science. Thus an analysis of the latest literature could be useful to show what the researchers are doing and what the research trend of this topic is. With that purpose in mind, this article analysis the articles published in the journals indexed by SCI between 2000 and 2009. In the paper, we not only introduce the literature reviews published in this 10-year period, but also study the models and algorithms most often considered in JSP articles. In addition, we investigate the subjects and journals with the most articles published.
job shop scheduling problem jsp publication categories of jsp studied algorithms of jsp
Kun Fan Ren-qian Zhang
School of Economics and Management Beijing Forestry University, BJFU Beijing, China School of Economics and Management Beihang University, BUAA Beijing, China
国际会议
成都
英文
282-288
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）