:::

詳目顯示

回上一頁
題名:An Improved Differential Evolution Algorithm for Permutation Flow Shop Scheduling Problem
書刊名:International Journal of Operations Research
作者:Rudi NurdiansyahOng Andre Wahju RijantoBudi SantosaStefanus Eko Wiratno
出版日期:2019
卷期:16:2
頁次:頁37-44
主題關鍵詞:Permutation flow shopMulti objectiveMeta-heuristics
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:3
期刊論文
1.Reza Hejazi, S.、Saghafian, S.(2005)。Flowshop-scheduling problems with makespan criterion: a review。International Journal of Production Research,43(14),2895-2929。  new window
2.Gangadharan, R.、Rajendran, C.(1993)。Heuristic algorithms for scheduling in the no-wait flowshop。International Journal of Production Economics,32(3),285-290。  new window
3.Palmer, D. S.(1965)。Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time: A Quick Method of Obtaining a Near Optimum。Journal of the Operational Research Society,16(1),101-107。  new window
4.Pan, Q.-K.、Tasgetiren, M. F.、Liang, Y.-C.(2008)。A Discrete differential evolution algorithm for the permutation flowshop scheduling problem。Computers & Industrial Engineering,55(4),795-816。  new window
5.Reeves, C. R.(1995)。A genetic algorithm for flowshop sequencing。Computers & Operations Research,22(1),5-13。  new window
6.Liu, Y.-F.、Liu, S.-Y.(2013)。A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem。Applied Soft Computing,13(3),1459-1463。  new window
7.Osman, I. H.、Potts, C. N.(1989)。Simulated annealing for permutation flow-shop scheduling。Omega,17(6),551-557。  new window
8.Nawaz, Muhammad、Enscore, E. Emory Jr.、Ham, Inyong(1983)。A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem。OMEGA: The International Journal of Management Science,11(1),91-95。  new window
9.Campbell, H. G.、Dudek, R. A.、Smith, M. L.(1970)。A Heuristic Algorithm for the n Job, m Machine Sequencing Problem。Management Science,16(10),630-667。  new window
10.Garey, M. R.、Johnson, D. S.、Sethi, R.(1976)。The complexity of flowshop and jobshop scheduling。Mathematics of Operations Research,1(2),117-129。  new window
11.Ying, K. C.、Liao, C. J.(2004)。An ant colony system for permutation flow-shop sequencing。Computers & Operations Research,31(5),791-801。  new window
12.Lai, Mingyong、Cao, Erbao(2010)。An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows。Engineering Applications of Artificial Intelligence,23(2),188-195。  new window
13.Noman, N.、Iba, H.(2008)。Accelerating Differential Evolution Using an Adaptive Local Search。IEEE Transactions On Evolutionary Computation,12(1),107-125。  new window
14.Storn, Rainer Martin、Price, Kenneth(1997)。Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces。Journal of Global Optimization,11(4),341-359。  new window
15.Qian, B.、Wang, L.、Hu, R.、Wang, W.-L.、Huang, D.-X.、Wang, X.(2008)。A hybrid differential evolution method for permutation flow-shop scheduling。International Journal of Advanced Manufacturing Technology,38(7/8),757-777。  new window
16.Taillard, E.(1993)。Benchmarks for basic scheduling problems。European Journal of Operational Research,64(2),278-285。  new window
17.Tasgetiren, M. F.、Liang, Y.-C.、Sevkli, M.、Gencyilmaz, G.(2007)。A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem。European Journal of Operational Research,177(3),1930-1947。  new window
18.Das, S.、Mullick, S. S.、Suganthan, P. N.(2016)。Recent advances in differential evolution--An updated survey。Swarm and Evolutionary Computation,27,1-30。  new window
19.Gao, H.、Liu, X.(2007)。Improved Artificial Immune Algorithm and its application on the Permutation Flow Shop Sequencing Problems。Information Technology Journal,6(6),929-933。  new window
20.Grabowski, J.、Wodecki, M.(2004)。A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion。Computers & Operations Research,31(11),1891-1909。  new window
21.Gupta, J. N.、Shanthikumar, J. G.、Szwarc, W.(1987)。Generating improved dominance conditions for the flowshop problem。Computers & operations research,14(1),41-45。  new window
22.Li, X.、Yin, M.(2013)。A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem。International Journal of Production Research,51(16),4732-4754。  new window
23.Lin, Q.、Gao, L.、Li, X.、Zhang, C.(2015)。A hybrid backtracking search algorithm for permutation flow-shop scheduling problem。Computers & Industrial Engineering,85,437-446。  new window
24.Qiu, C. H.、Wang, C.(2010)。An immune particle swarm optimization algorithm for solving permutation flowshop problem。Key Engineering Materials,419/420,133-136。  new window
25.Ravindran, D.、Selvakumar, S. J.、Sivaraman, R.、Haq, A. N.(2005)。Flow shop scheduling with multiple objective of minimizing makespan and total flow time。The international journal of advanced manufacturing technology,25(9/10),1007-1012。  new window
26.Tasgetiren, M. F.、Pan, Q.-K.、Suganthan, P. N.、Chen, A. H.-L.(2011)。A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops。Information Sciences,181(16),3459-3475。  new window
27.Tvrdík, J.(2007)。Differential evolution with competitive setting of control parameters。Task Quarterly,11(1/2),169-179。  new window
28.Yagmahan, B.、Yenisey, M. M.(2010)。A multi-objective ant colony system algorithm for flow shop scheduling problem。Expert Systems with Applications,37(2),1361-1368。  new window
29.Zhang, Y.、Li, X.、Wang, Q.(2009)。Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization。European Journal of Operational Research,196(3),869-876。  new window
會議論文
1.Tasgetiren, M. F.、Sevkli, M.、Liang, Y.-C.、Gencyilmaz, G.(2004)。Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion。The 4th International Symposium on Intelligent Manufacturing Systems,442-452。  new window
2.Liu, J.(2002)。On setting the control parameter of the differential evolution method11-18。  new window
3.Sauer, J. G.、Coelho, L. S.(2008)。Discrete Differential Evolution with local search to solve the Traveling Salesman Problem: Fundamentals and case studies。2008 7th IEEE International Conference on Cybernetic Intelligent Systems。  new window
4.Seyed-Alagheband, S. A.、Davoudpour, H.、Doulabi, S. H. H.、Khatibi, M.(2009)。Using a modified simulated annealing algorithm to minimize makespan in a permutation flow-shop scheduling problem with job deterioration20-22。  new window
5.Thangaraj, R.、Pant, M.、Abraham, A.(2009)。A simple adaptive differential evolution algorithm。2009 world congress on nature & biologically inspired computing (nabic)。  new window
6.Zaharie, D.(2002)。Critical values for the control parameters of differential evolution algorithms62-67。  new window
7.Zamuda, A.、Brest, J.、Boskovic, B.、Zumer, V.(2009)。Differential evolution with self-adaptation and local search for constrained multiobjective optimization。2009 IEEE Congress on Evolutionary Computation。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE