A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion

DOI10.1016/j.cor.2013.09.014zbMath1348.90295OpenAlexW2042057184MaRDI QIDQ337223

Ghasem Moslehi, Danial Khorasanian

Publication date: 10 November 2016

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

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

zbMATH Keywords

schedulingmakespansimulated annealing algorithmvariable neighborhood searchblocking flow shoplimited-buffer permutation flow shop

Mathematics Subject Classification ID

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

Related Items (5)

Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search

Cites Work

• Unnamed Item
• Variable neighborhood search for location routing
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
• Some efficient heuristic methods for the flow shop sequencing problem
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• A two-machine permutation flow shop scheduling problem with buffers
• A genetic algorithm for flowshop sequencing
• Variable neighborhood search
• The permutation flow shop with buffers: A tabu search approach
• 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
• 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
• Variable neighborhood search and local branching
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• Critical-Path Planning and Scheduling: Mathematical Basis
• Flowshop sequencing problems with limited buffer storage
• Ordonnancements à contraintes disjonctives
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion