A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
From MaRDI portal
Publication:1736840
DOI10.3390/a9040071zbMath1461.90058OpenAlexW2539426768MaRDI QIDQ1736840
Kai-Zhou Gao, Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-ke Pan
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a9040071
constructive heuristicsmeta-heuristicsblocking flowshopblock insertion heuristicvariable local search
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Variable neighborhood search
- Sequencing of jobs in some production system
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Benchmarks for basic scheduling problems
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Flowshop sequencing problems with limited buffer storage
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing Cycle Time in a Blocking Flowshop
- Lower bounding schemes for flowshops with blocking in-process
- Design and Analysis of Experiments, Second Edition
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Handbook on Scheduling
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
