An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop
Published 2014 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop
Authors
Keywords
-
Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 52, Issue 13, Pages 3802-3819
Publisher
Informa UK Limited
Online
2014-03-25
DOI
10.1080/00207543.2014.899719
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
- (2013) Imma Ribas et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- (2012) Quan-Ke Pan et al. COMPUTERS & OPERATIONS RESEARCH
- Multistart Iterated Tabu Search for Bandwidth Coloring Problem
- (2012) Xiangjing Lai et al. COMPUTERS & OPERATIONS RESEARCH
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- (2012) Xingye Dong et al. COMPUTERS & OPERATIONS RESEARCH
- New VNS heuristic for total flowtime flowshop scheduling problem
- (2012) Wagner Emanoel Costa et al. EXPERT SYSTEMS WITH APPLICATIONS
- Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
- (2012) Le Liu et al. INFORMATION SCIENCES
- A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer
- (2012) Christian Almeder et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness
- (2012) Jeffrey Schaller et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- (2011) Alexandre X. Martins et al. COMPUTERS & OPERATIONS RESEARCH
- A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
- (2011) J. Behnamian et al. EXPERT SYSTEMS WITH APPLICATIONS
- Scheduling a permutation flow shop with family setups to minimise total tardiness
- (2011) Jeffrey Schaller INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs
- (2010) Mariam Tagmouti et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
- (2010) Paz Perez-Gonzalez et al. COMPUTERS & OPERATIONS RESEARCH
- A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop
- (2010) Safa Khalouli et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Optimal PMU placement using Iterated Local Search
- (2010) M. Hurtgen et al. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
- Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines
- (2010) Deming Lei et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Variable neighbourhood search: methods and applications
- (2009) Pierre Hansen et al. ANNALS OF OPERATIONS RESEARCH
- Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
- (2009) G. Moslehi et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- (2009) J. Behnamian et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Dynamic job shop scheduling using variable neighbourhood search
- (2009) M. Zandieh et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆
- (2009) Eva Vallada et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- (2008) Xingye Dong et al. COMPUTERS & OPERATIONS RESEARCH
- Finding maximin latin hypercube designs by Iterated Local Search heuristics
- (2008) A. Grosso et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- (2008) J. M. Framinan et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Permutation flow shop scheduling with earliness and tardiness penalties
- (2008) Pankaj Chandra et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
- (2008) N Madhushini et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- (2007) Jie Gao et al. COMPUTERS & OPERATIONS RESEARCH
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- (2007) Toshihide Ibaraki et al. DISCRETE APPLIED MATHEMATICS
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- (2007) Hideki Hashimoto et al. Discrete Optimization
- Variable neighborhood search for minimum cost berth allocation
- (2007) Pierre Hansen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- (2006) Eva Vallada et al. COMPUTERS & OPERATIONS RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now