相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem
Maria Raquel C. Costa et al.
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL (2020)
Two hybrid metaheuristic approaches for the covering salesman problem
Venkatesh Pandiri et al.
NEURAL COMPUTING & APPLICATIONS (2020)
On the flexibility of a decision theory-based heuristic for single machine scheduling
Christian Gahm et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines
Jeffrey Schaller et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2018)
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness
Victor Fernandez-Viagas et al.
EXPERT SYSTEMS WITH APPLICATIONS (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)
Two grouping-based metaheuristics for clique partitioning problem
Shyam Sundar et al.
APPLIED INTELLIGENCE (2017)
A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops
Korhan Karabulut
COMPUTERS & INDUSTRIAL ENGINEERING (2016)
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
Tomas C. Goncalves et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
A comprehensive review of flowshop group scheduling literature
Janis S. Neufeld et al.
COMPUTERS & OPERATIONS RESEARCH (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)
A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Victor Fernandez-Viagas 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)
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
Xiaoping Li et al.
OPERATIONS RESEARCH PERSPECTIVES (2015)
An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness
J. Schaller et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2013)
Minimizing the weighted sum of squared tardiness on a single machine
Jeffrey Schaller et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
Jorge M. S. Valente et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Scheduling a permutation flow shop with family setups to minimise total tardiness
Jeffrey Schaller
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2012)
Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects
Yi Sun et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2011)
Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem
Eva Vallada et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2010)
An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
Xingye Dong et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
Eva Vallada et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Ruben Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
J. M. Framinan et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (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 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 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 enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
A Grosso et al.
OPERATIONS RESEARCH LETTERS (2004)
An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
RK Congram et al.
INFORMS JOURNAL ON COMPUTING (2002)
Job shop scheduling with alternative process plans
CS Thomalla
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2001)
分享论文
