Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
From MaRDI portal
Publication:1041924
DOI10.1016/j.ejor.2008.04.033zbMath1176.90523OpenAlexW2079003114MaRDI QIDQ1041924
Qian Wang, Yi Zhang, Xiao-Ping Li
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.033
Related Items (15)
A N-N optimization model for logistic resources allocation with multiple logistic tasks under demand uncertainty ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ A variable neighborhood descent approach for the two-dimensional bin packing problem ⋮ Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ Scheduling problem in seru production system considering DeJong's learning effect and job splitting ⋮ A poly-hybrid PSO optimization method with intelligent parameter adjustment ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ Unnamed Item
Cites Work
- Unnamed Item
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimizing total tardiness in permutation flowshops
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A genetic algorithm for flowshop sequencing
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- 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
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- The Complexity of Flowshop and Jobshop Scheduling
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
