A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333): Difference between revisions

Latest revision as of 05:35, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

14 December 2006

0 references

zbMATH Keywords

scheduling

0 references

particle swarm optimization

0 references

permutation flowshop

0 references

variable neighborhood search

0 references

makespan

0 references

total flowtime

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2005.12.024

0 references

cites work

Genetic Algorithms and Random Keys for Sequencing and Optimization

0 references

A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem

0 references

An Evaluation of Flow Shop Sequencing Heuristics

0 references

Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation

0 references

Comparison of heuristics for flowtime minimisation in permutation flowshops

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion

0 references

Flowshop sequencing with mean flowtime objective

0 references

A new heuristic for the n-job, M-machine flow-shop problem

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

0 references

ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING

0 references

AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM

0 references

Variable neighborhood search

0 references

A fast tabu search algorithm for the permutation flow-shop problem

0 references

The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem

0 references

Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization

0 references

A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria

0 references

A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME

0 references

An efficient heuristic approach to the scheduling of jobs in a flowshop

0 references

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

0 references

Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.

0 references

Improving the Efficiency of Tabu Search for Machine Sequencing Problems

0 references

A genetic algorithm for flowshop sequencing

0 references

On general routing problems

0 references

On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem

0 references

Some efficient heuristic methods for the flow shop sequencing problem

0 references

Benchmarks for basic scheduling problems

0 references

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

0 references

Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem

0 references

Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems

0 references

Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

0 references

A heuristic algorithm for mean flowtime objective in flowshop scheduling

0 references

Identifiers

zbMATH Open document ID

1110.90044

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1016/J.EJOR.2005.12.024

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:857333

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