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

Cites Work

Title not available (Why is that?)
Variable neighborhood search
A genetic algorithm for flowshop sequencing
Variable neighborhood search and local branching
Benchmarks for basic scheduling problems
Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
Critical-Path Planning and Scheduling: Mathematical Basis
Variable neighborhood search for location routing
Ordonnancements à contraintes disjonctives
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Some efficient heuristic methods for the flow shop sequencing problem
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
A two-machine permutation flow shop scheduling problem with buffers
The permutation flow shop with buffers: A tabu search approach
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
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
Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems

Cited In (7)

Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
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
A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion

Recommendations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337223)