Some efficient heuristic methods for the flow shop sequencing problem
From MaRDI portal
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Distributed algorithms (68W15)
Recommendations
- A new heuristic method for the flow shop sequencing problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A high quality solution constructive heuristic for flow shop sequencing
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A heuristic search algorithm for flow-shop scheduling
- A fast method for heuristics in large-scale flow shop scheduling
- A Note on Heuristics of Flow-Shop Scheduling
- Heuristic algorithms for continuous flow-shop problem
- A heuristic algorithm for Flow Shop problem in batch processing
- A new constructive heuristic for the flowshop scheduling problem
Cites work
Cited in
(only showing first 100 items - show all)- Some aspects of scatter search in the flow-shop problem
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Tabu search for a class of single-machine scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Flowshop-scheduling problems with makespan criterion: a review
- Fuzzy sets and operations research: Perspectives
- A two-machine permutation flow shop scheduling problem with buffers
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A generalized constructive algorithm using insertion-based heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Two-stage hybrid flow shop with recirculation
- A tabu search approach for the flow shop scheduling problem
- Some results of the worst-case analysis for flow shop scheduling
- The flow shop with parallel machines: A tabu search approach
- Local search methods for the flowshop scheduling problem with flowtime minimization
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A genetic algorithm for flowshop sequencing
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- An improved NEH-based heuristic for the permutation flowshop problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Benchmarks for basic scheduling problems
- Heuristics for scheduling in a flow shop with multiple processors
- An empirical analysis of the optimality rate of flow shop heuristics
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- A fast tabu search algorithm for the permutation flow-shop problem
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Heuristics for permutation flow shop scheduling with batch setup times
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Sequencing of jobs in some production system
- Scheduling flow shops using differential evolution algorithm
- A new constructive heuristic for the flowshop scheduling problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Unrelated parallel machine scheduling using local search
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A user's guide to tabu search
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Heuristics for the flow line problem with setup costs
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Job-shop production scheduling with reverse flows
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A matheuristic approach for the two-machine total completion time flow shop problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A high quality solution constructive heuristic for flow shop sequencing
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- Genetic algorithms and tabu search: Hybrids for optimization
- A fast method for heuristics in large-scale flow shop scheduling
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- The distributed permutation flowshop scheduling problem
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Scheduling production tasks in a two-stage FMS
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
- Research on m‐machine flow shop scheduling with truncated learning effects
- Iterative beam search algorithms for the permutation flowshop
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
This page was built for publication: Some efficient heuristic methods for the flow shop sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915635)
