Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

DOI10.1016/j.cor.2016.07.002zbMath1391.90323OpenAlexW2472289588MaRDI QIDQ1652026

Y. Aharonov

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.002

zbMATH Keywords

constructive heuristicsmeta-heuristicsvariable neighborhood searchiterated greedy algorithmblocking flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (19)

Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types ⋮ Makespan preserving flowshop reengineering via blocking constraints

Cites Work

• Unnamed Item
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop 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
• A fast tabu search algorithm for the permutation flow-shop problem
• A two-machine permutation flow shop scheduling problem with buffers
• Variable neighborhood search
• Sequencing of jobs in some production system
• The permutation flow shop with buffers: A tabu search approach
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• 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
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• 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
• 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: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion