A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

DOI10.1016/j.ejor.2005.12.024zbMath1110.90044OpenAlexW1970320473MaRDI QIDQ857333

Yun-Chia Liang, Gunes Gencyilmaz, Mehmet Sevkli, M. Fatih Tasgetiren

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.024

zbMATH Keywords

schedulingmakespanvariable neighborhood searchparticle swarm optimizationpermutation flowshoptotal flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A new heuristic algorithm for laser antimissile strategy optimization ⋮ Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA ⋮ Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry ⋮ Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ Hidden Markov models training by a particle swarm optimization algorithm ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Solving the unconstrained optimization problem by a variable neighborhood search ⋮ An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ Multiobjective particle swarm optimization with nondominated local and global sets ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources ⋮ Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak ⋮ Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ A two-machine flowshop scheduling problem with precedence constraint on two jobs ⋮ A unified framework for population-based metaheuristics ⋮ An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A discrete particle swarm optimization for lot-streaming flowshop scheduling problem ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ 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 block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Directed particle swarm optimization with Gaussian-process-based function forecasting ⋮ A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems ⋮ Methods for multi-objective optimization: an analysis ⋮ Introducing dynamic diversity into a discrete particle swarm optimization ⋮ Optimizing version release dates of research and development long-term processes ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ 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 ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Variable neighbourhood search: methods and applications ⋮ Putting continuous metaheuristics to work in binary search spaces ⋮ Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES ⋮ Job shop scheduling optimization through multiple independent particle swarms ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ Variable neighbourhood search: Methods and applications ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ The distributed permutation flowshop scheduling problem ⋮ Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ Unnamed Item ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

Cites Work

• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Flowshop sequencing with mean flowtime objective
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• A fast tabu search algorithm for the permutation flow-shop problem
• Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A genetic algorithm for flowshop sequencing
• Variable neighborhood search
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A new heuristic for the n-job, M-machine flow-shop problem
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Optimal two- and three-stage production schedules with setup times included
• Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• On general routing problems
• An Evaluation of Flow Shop Sequencing Heuristics
• AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
• The Complexity of Flowshop and Jobshop Scheduling
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem