Related references
Note: Only part of the references are listed.Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems
Shih-Wei Lin et al.
EXPERT SYSTEMS WITH APPLICATIONS (2021)
Fast Evolutionary Algorithm for Flow Shop Scheduling Problems
Bilal Khurshid et al.
IEEE ACCESS (2021)
More MILP models for hybrid flow shop scheduling problem and its extended problems
Leilei Meng et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2020)
An improved lower bound for the blocking permutation flow shop with total completion time criterion
Marcelo Seido Nagano et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2020)
Hybrid evolution strategy approach for robust permutation flowshop scheduling
B. Khurshid et al.
ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT (2020)
Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem
Zhongshi Shao et al.
SWARM AND EVOLUTIONARY COMPUTATION (2020)
A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective
Fuqing Zhao et al.
EXPERT SYSTEMS WITH APPLICATIONS (2019)
Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm
Carlos E. Andrade et al.
EXPERT SYSTEMS WITH APPLICATIONS (2019)
An Improved Discrete Artificial Bee Colony Algorithm for Flexible Flowshop Scheduling with Step Deteriorating Jobs and Sequence-Dependent Setup Times
Hua Xuan et al.
MATHEMATICAL PROBLEMS IN ENGINEERING (2019)
被撤回的出版物: 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)
Efficient heuristics for the parallel blocking flow shop scheduling problem
Imma Ribas et al.
EXPERT SYSTEMS WITH APPLICATIONS (2017)
An improved heuristic for no-wait flow shop to minimize makespan
Honghan Ye et al.
JOURNAL OF MANUFACTURING SYSTEMS (2017)
A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem
Jian Lin et al.
SWARM AND EVOLUTIONARY COMPUTATION (2017)
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
Alexander J. Benavides et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
A self-guided differential evolution with neighborhood search for permutation flow shop scheduling
Weishi Shao et al.
EXPERT SYSTEMS WITH APPLICATIONS (2016)
A new heuristic based on local best solution for permutation flow shop scheduling
Chun-Lung Chen et al.
APPLIED SOFT COMPUTING (2015)
The third comprehensive survey on scheduling problems with setup times/costs
Ali Allahverdi
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm
Jun-qing Li et al.
INFORMATION SCIENCES (2015)
Automatic learning of image filters using Cartesian genetic programming
P. C. D. Paris et al.
INTEGRATED COMPUTER-AIDED ENGINEERING (2015)
A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking
Yu-Yan Han et al.
ENGINEERING OPTIMIZATION (2015)
An effective differential evolution algorithm for permutation flow shop scheduling problem
Ying Liu et al.
APPLIED MATHEMATICS AND COMPUTATION (2014)
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)
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 BRANCH AND BOUND ALGORITHM FOR THE TWO-MACHINE FLOWSHOP PROBLEM WITH UNIT-TIME OPERATIONS AND TIME DELAYS
Aziz Moukrim et al.
RAIRO-OPERATIONS RESEARCH (2014)
A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
Chun-Lung Chen et al.
SOFT COMPUTING (2014)
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)
Fast learning neural networks using Cartesian genetic programming
Maryam Mahsal Khan et al.
NEUROCOMPUTING (2013)
Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem
Yannis Marinakis et al.
SOFT COMPUTING (2013)
A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling
Deng Guanlong et al.
CHINESE JOURNAL OF CHEMICAL ENGINEERING (2012)
Effective heuristics for the blocking flowshop scheduling problem with makespan minimization
Quan-Ke Pan et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2012)
Solving flow shop scheduling problem using a parallel genetic algorithm
Mostafa Akhshabi et al.
FIRST WORLD CONFERENCE ON INNOVATION AND COMPUTER SCIENCES (INSODE 2011) (2012)
An iterated greedy algorithm for the flowshop scheduling problem with blocking
Imma Ribas et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2011)
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
C. T. Ng et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Ling Wang et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem
Lin-Yu Tseng et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2010)
Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem
Eva Vallada et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2010)
Minimising total flow time in permutation flow shop scheduling using a simulated annealing-based approach
Dipak Laha et al.
INTERNATIONAL JOURNAL OF AUTOMATION AND CONTROL (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 differential evolution method for permutation flow-shop scheduling
Bin Qian 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)
On the NEH heuristic for minimizing the makespan in permutation flow shops
Pawel Jan Kalczynski et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2007)
Two new robust genetic algorithms for the flowshop scheduling problem
R Ruiz et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2006)
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
DP Ronconi
ANNALS OF OPERATIONS RESEARCH (2005)
A note on constructive heuristics for the flowshop problem with blocking
DP Ronconi
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2004)
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
J Grabowski et al.
COMPUTERS & OPERATIONS RESEARCH (2004)
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
CS Chung et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2002)
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
F Della Croce et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
Constructive and composite heuristic solutions to the P//ΣCi scheduling problem
JY Liu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)
Minimizing makespan in a blocking flowshop using genetic algorithms
V Caraffa et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2001)
Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems
L Costa et al.
COMPUTERS & CHEMICAL ENGINEERING (2001)
A two-phase heuristic approach to the permutation flow-shop scheduling problem
SMA Suliman
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2000)
A branch-and-bound algorithm for the hybrid flowshop
O Moursli et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2000)
Share Paper
