Flowshop scheduling research after five decades

被引:234
作者
Gupta, JND [1 ]
Stafford, EF [1 ]
机构
[1] Univ Alabama, Coll Adm Sci, Huntsville, AL 35899 USA
关键词
flowshop scheduling; historical developments; problem assumptions; current research status; future research directions;
D O I
10.1016/j.ejor.2005.02.001
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Since Johnson's seminal paper in 1954, flowshop scheduling problems have received considerable research attention over the last fifty years. As a result, several optimization and heuristic solution procedures are available to solve a variety of flowshop scheduling problems. This paper provides a brief glimpse into the evolution of flowshop scheduling problems and possible approaches for their solution over the last fifty years. It briefly introduces the current flowshop problems being solved and the approaches being taken to solve (optimally or approximately) them. The paper concludes with some fruitful directions for future research. © 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:699 / 711
页数:13
相关论文
共 60 条
[1]  
AARTS E, 1997, LOCAL SEARCH COMBINA
[2]   A review of scheduling research involving setup considerations [J].
Allahverdi, A ;
Gupta, JND ;
Aldowaisan, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02) :219-239
[3]  
[Anonymous], 1982, DETERMINISTIC STOCHA
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]  
[Anonymous], INTELLIGENT SCHEDULI
[6]  
Ashour Said, 1972, Sequencing Theory
[7]   MATHEMATICAL ASPECTS OF SCHEDULING THEORY [J].
BELLMAN, R .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1956, 4 (03) :168-205
[8]  
BELLMAN R, 1954, J SOC IND APPL MATH, V2, P175
[9]  
Bellman R, 1982, MATH ASPECTS SCHEDUL
[10]   SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM [J].
BROWN, APG ;
LOMNICKI, ZA .
OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (02) :173-&