相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
An improved artificial bee colony algorithm for steelmaking-refining-continuous casting scheduling problem
Kunkun Peng et al.
CHINESE JOURNAL OF CHEMICAL ENGINEERING (2018)
Fast heuristics for minimizing the makespan in non-permutation flow shops
Alexander J. Benavides et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
被撤回的出版物: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem (Retracted article. See vol. 128, pg. 567, 2022)
Mohamed Abdel-Basset et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2018)
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
Victor Fernandez-Viagas et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops
Arindam Chakravorty et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2017)
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Jeremie Dubois-Lacoste et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
A Discrete Inter-Species Cuckoo Search for flowshop scheduling problems
Preetam Dasgupta et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
New hard benchmark for flowshop scheduling problems minimising makespan
Eva Vallada et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
Ghasem Moslehi et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
Quan-Ke Pan et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2014)
Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
Mehmet Mutlu Yenisey et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2014)
A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
Chun-Lung Chen et al.
SOFT COMPUTING (2014)
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
M. Fatih Tasgetiren et al.
APPLIED MATHEMATICAL MODELLING (2013)
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem
Yan-Feng Liu et al.
APPLIED SOFT COMPUTING (2013)
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Shih-Wei Lin et al.
COMPUTERS & OPERATIONS RESEARCH (2013)
A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking
Xianpeng Wang et al.
APPLIED SOFT COMPUTING (2012)
A new ant colony algorithm for makespan minimization in permutation flow shops
Fardin Ahmadizar
COMPUTERS & INDUSTRIAL ENGINEERING (2012)
A hybrid EDA with ACS for solving permutation flow shop scheduling
Yeu-Ruey Tzeng et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2012)
A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
A. Noorul Haq et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2010)
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
G. I. Zobolas et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
Lin-Yu Tseng et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling
Dipak Laha et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2009)
New high performing heuristics for minimizing makespan in permutation flowshops
Shahriar Farahmand Rad et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2009)
A Constructive Genetic Algorithm for permutation flowshop scheduling
Marcelo Seido Nagano et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Quan-Ke Pan et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
Performance evaluation of the scatter search method for permutation flowshop sequencing problems
M. Saravanan et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2008)
The permutation flow shop problem with blocking. A tabu search approach
Jozef Grabowski et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2007)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Ruben Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
M. Fatih Tasgetiren et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
T Pasupathy et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2006)
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
TK Varadharajan et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
Flowshop-scheduling problems with makespan criterion: a review
SR Hejazi et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2005)
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
J Grabowski et al.
COMPUTERS & OPERATIONS RESEARCH (2004)
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
JM Framinan et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2004)
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
C Rajendran et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
JM Framinan et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
分享论文
