A multi-objective particle swarm for a flow shop scheduling problem

DOI10.1007/s10878-006-9015-7zbMath1112.90037OpenAlexW2012700644MaRDI QIDQ867030

S. M. Mirghorbani, Alireza Rahimi-Vahed

Publication date: 14 February 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9015-7

zbMATH Keywords

Bi-criteria flow shop scheduling problemMulti-objective genetic algorithmMulti-objective particle swarmPermutation flow shop

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem ⋮ A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling ⋮ A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA ⋮ Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period ⋮ Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem ⋮ Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem ⋮ Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art ⋮ An improved multiobjective PSO for the scheduling problem of panel block construction ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ Unnamed Item ⋮ Interactive bicriterion decision support for a large scale industrial scheduling system

Uses Software

• PAES
• SPEA2
• MOPSO

Cites Work

• Unnamed Item
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• The job shop scheduling problem: Conventional and new solution techniques
• A tabu search approach for the flow shop scheduling problem
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• The two-machine flow-shop problem with weighted late work criterion and common due date
• A bicriteria approach to the two-machine flow shop scheduling problem
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• A neuro-tabu search heuristic for the flow shop scheduling problem
• Solving multi-objective production scheduling problems using metaheuristics
• A comparison of neighborhood search techniques for multi-objective combinatorial problems
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
• Some aspects of scatter search in the flow-shop problem
• Flowshop scheduling research after five decades
• Multiobjective Optimization
• KI 2005: Advances in Artificial Intelligence
• Genetic local search for multi-objective combinatorial optimization
• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: A multi-objective particle swarm for a flow shop scheduling problem