相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs
J. D. Huang et al.
ENGINEERING OPTIMIZATION (2017)
An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion
Fernando Luis Rossi et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2017)
Efficient heuristics for the parallel blocking flow shop scheduling problem
Imma Ribas et al.
EXPERT SYSTEMS WITH APPLICATIONS (2017)
A new improved NEH heuristic for permutation flowshop scheduling problems
Weibo Liu et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2017)
A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop
Marcelo Seido Nagano et al.
PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT (2017)
Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems
Kuo-Ching Yine et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2017)
Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion
Weishi Shao et al.
APPLIED SOFT COMPUTING (2017)
Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
Yuan-Yuan Lu
APPLIED MATHEMATICAL MODELLING (2016)
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
Alexander J. Benavides et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
The high performing backtracking algorithm and heuristic for the sequence-dependent setup times flowshop problem with total weighted tardiness
Jun-Xi Zheng et al.
ENGINEERING OPTIMIZATION (2016)
A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time
Weibo Liu et al.
ENGINEERING OPTIMIZATION (2016)
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime
Victor Fernandez-Viagas et al.
EXPERT SYSTEMS WITH APPLICATIONS (2016)
Evaluation of high performance constructive heuristics for the flow shop with makespan minimization
Fernando Luis Rossi et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2016)
A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
Yongquan Zhou et al.
NEUROCOMPUTING (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 variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
M. Fatih Tasgetiren et al.
COMPUTERS & OPERATIONS RESEARCH (2013)
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Quan-Ke Pan et al.
COMPUTERS & OPERATIONS RESEARCH (2013)
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
Guanlong Deng et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
M. Fatih Tasgetiren et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2011)
Comparing three-step heuristics for the permutation flow shop problem
Imma Ribas et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
An empirical analysis of the optimality rate of flow shop heuristics
Pawel J. Kalczynski et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
A heuristic to minimize total flow time in permutation flow shop
Dipak Laha et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2009)
New high performing heuristics for minimizing makespan in permutation flowshops
Shahriar Farahmand Rad et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2009)
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Quan-Ke Pan et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
An improved NEH-based heuristic for the permutation flowshop problem
Xingye Dong et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
An improved NEH heuristic to minimize makespan in permutation flow shops
Pawel J. Kalczynski et al.
COMPUTERS & OPERATIONS RESEARCH (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)
Heuristic for no-wait flow shops with makespan minimization
Xiaoping Li et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2008)
No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
Quan-Ke Pan et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2008)
On the NEH heuristic for minimizing the makespan in permutation flow shops
Pawel Jan Kalczynski et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2007)
Flowshop/no-idle scheduling to minimise the mean flowtime
L Narain et al.
ANZIAM JOURNAL (2005)
A heuristic for minimizing the makespan in no-idle permutation flow shops
PJ Kalczynski et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2005)
Comparison of heuristics for flowtime minimisation in permutation flowshops
JA Framinan et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
A travelling salesman approach to solve the F/no-idle/Cmax problem
NE Saadani et al.
EUROPEAN JOURNAL OF OPERATIONAL 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)
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
JM Framinan et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2003)
A high quality solution constructive heuristic for flow shop sequencing
MS Nagano et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2002)
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
JM Framinan 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)
Constructive and improvement flow shop scheduling heuristics: an extensive evaluation
SG Ponnambalam et al.
PRODUCTION PLANNING & CONTROL (2001)
分享论文
