相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Parallel hybrid heuristics for the permutation flow shop problem
Martin Gomez Ravetti et al.
ANNALS OF OPERATIONS RESEARCH (2012)
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
Orhan Engin et al.
APPLIED SOFT COMPUTING (2011)
MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm
Yann Cooren et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2011)
A self-adaptive local search algorithm for the classical vehicle routing problem
Cigdem Alabas-Uslu et al.
EXPERT SYSTEMS WITH APPLICATIONS (2011)
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
A. A. Juan et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2011)
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
Angel A. Juan et al.
APPLIED SOFT COMPUTING (2010)
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach
Cengiz Kahraman et al.
APPLIED SOFT COMPUTING (2010)
Comparing three-step heuristics for the permutation flow shop problem
Imma Ribas et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
Solving flow shop scheduling problems by quantum differential evolutionary algorithm
Tianmin Zheng et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2010)
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
G. I. Zobolas et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
An annotated bibliography of GRASP-Part II: Applications
Paola Festa et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2009)
An annotated bibliography of GRASP - Part I: Algorithms
Paola Festa et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2009)
A Constructive Genetic Algorithm for permutation flowshop scheduling
Marcelo Seido Nagano et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
Quan-Ke Pan et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2008)
Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax,, and Fm|block|Cmax problems
Ramon Companys et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Ruben Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
Two new robust genetic algorithms for the flowshop scheduling problem
R Ruiz et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2006)
Metaheuristics in combinatorial optimization
M Gendreau et al.
ANNALS OF OPERATIONS RESEARCH (2005)
A comprehensive review and evaluation of permutation flowshop heuristics
R Ruiz 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 computational study of the permutation flow shop problem based on a tight lower bound
T Ladhari et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
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)
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
JM Framinan et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2003)
New heuristics for no-wait flowshops to minimize makespan
T Aldowaisan et al.
COMPUTERS & OPERATIONS RESEARCH (2003)
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
M Prais et al.
INFORMS JOURNAL ON COMPUTING (2000)
A two-phase heuristic approach to the permutation flow-shop scheduling problem
SMA Suliman
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2000)
分享论文
