Related references
Note: Only part of the references are listed.Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms
Hao-Chin Chang et al.
JOURNAL OF INTELLIGENT MANUFACTURING (2017)
Efficient heuristics for the parallel blocking flow shop scheduling problem
Imma Ribas et al.
EXPERT SYSTEMS WITH APPLICATIONS (2017)
Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems
Kuo-Ching Yine et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2017)
General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem
M. Komaki et al.
PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT (2017)
Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm
Shih-Wei Lin et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2016)
Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling
Achmad P. Rifai et al.
APPLIED SOFT COMPUTING (2016)
Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness
Shih-Wei Lin et al.
APPLIED SOFT COMPUTING (2015)
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
Victor Fernandez-Viagas et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2015)
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem
Ye Xu et al.
ENGINEERING OPTIMIZATION (2014)
A scatter search algorithm for the distributed permutation flowshop scheduling problem
Bahman Naderi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Modeling and heuristics for scheduling of distributed job shops
B. Naderi et al.
EXPERT SYSTEMS WITH APPLICATIONS (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)
A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem
Jian Gao et al.
International Journal of Computational Intelligence Systems (2013)
A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem
Felix T. S. Chan et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Jian Gao et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Shih-Wei Lin et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)
A new ant colony algorithm for makespan minimization in permutation flow shops
Fardin Ahmadizar
COMPUTERS & INDUSTRIAL ENGINEERING (2012)
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems
Shih-Hsin Chen et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
E. Torabzadeh et al.
ADVANCES IN ENGINEERING SOFTWARE (2010)
The distributed permutation flowshop scheduling problem
B. Naderi 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)
Cloud theory-based simulated annealing algorithm and application
Pin Lv et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2009)
New high performing heuristics for minimizing makespan in permutation flowshops
Shahriar Farahmand Rad et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2009)
A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods
Burak Eksioglu et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems
Quan-Ke Pan et al.
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING (2008)
Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic
Kuo-Ching Ying
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2008)
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)
Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
Felix T. S. Chan et al.
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING (2006)
Scheduling flow shops using differential evolution algorithm
G Onwubolu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
An adaptive genetic algorithm with dominated genes for distributed scheduling problems
FTS Chan et al.
EXPERT SYSTEMS WITH APPLICATIONS (2005)
A heuristic for minimizing the makespan in no-idle permutation flow shops
PJ Kalczynski et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2005)
A travelling salesman approach to solve the F/no-idle/Cmax problem
NE Saadani et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
An ant colony system for permutation flow-shop sequencing
KC Ying et al.
COMPUTERS & OPERATIONS RESEARCH (2004)
More on three-machine no-idle flow shops
J Kamburowski
COMPUTERS & INDUSTRIAL ENGINEERING (2004)
Share Paper
