A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
From MaRDI portal
Publication:857345
DOI10.1016/j.ejor.2005.12.009zbMath1110.90042OpenAlexW2006751452MaRDI QIDQ857345
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.009
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Solving real-size stochastic railway rapid transit network construction scheduling problems ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem ⋮ Particle therapy patient scheduling with limited starting time variations of daily treatments ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem ⋮ An iterated greedy algorithm for finding the minimum dominating set in graphs ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem ⋮ The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ Discrete/Binary Approach ⋮ Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ Carbon-efficient scheduling of flow shops by multi-objective optimization ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ The weighted independent domination problem: integer linear programming models and metaheuristic approaches ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates ⋮ Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach ⋮ Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect ⋮ Evaluating balancing on social networks through the efficient solution of correlation clustering problems ⋮ Improving the anytime behavior of two-phase local search ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ Diversity controlling genetic algorithm for order acceptance and scheduling problem ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Flow shop scheduling with heterogeneous workers ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ Large neighbourhood search algorithms for the founder sequence reconstruction problem ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ A memetic algorithm for the team orienteering problem ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Iterated greedy for the maximum diversity problem ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ Shifting representation search for hybrid flexible flowline problems ⋮ Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning ⋮ Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches ⋮ The distributed permutation flowshop scheduling problem ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Optimal two- and three-stage production schedules with setup times included
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Note: A local-search heuristic for large set-covering problems
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
