dblp.uni-trier.dewww.uni-trier.de

Quan-Qe Pan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
8EEMehmet Fatih Tasgetiren, Quan-Qe Pan, Yun-Chia Liang: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers & OR 36(6): 1900-1915 (2009)
2008
7EEMehmet Fatih Tasgetiren, Quan-Qe Pan, Yun-Chia Liang: A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times. IEEE Congress on Evolutionary Computation 2008: 2613-2620
6EEQuan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang, Ponnuthurai N. Suganthan: Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. IEEE Congress on Evolutionary Computation 2008: 2955-2961
5EEQuan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & OR 35(9): 2807-2839 (2008)
2007
4EEQuan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. GECCO 2007: 126-133
3EEMehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Qe Pan: A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. GECCO 2007: 158-167
2EEMehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Qe Pan, Yun-Chia Liang: A genetic algorithm for the generalized traveling salesman problem. IEEE Congress on Evolutionary Computation 2007: 2382-2389
2006
1EEQuan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang: Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. ANTS Workshop 2006: 460-467

Coauthor Index

1Yun-Chia Liang [1] [2] [4] [5] [6] [7] [8]
2Ponnuthurai N. Suganthan [2] [3] [6]
3Mehmet Fatih Tasgetiren [1] [2] [3] [4] [5] [6] [7] [8]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)