Some efficient heuristic methods for the flow shop sequencing problem
From MaRDI portal
Numerical mathematical programming methods (65K05) Distributed algorithms (68W15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
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)- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- The distributed permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- A new heuristic method for the flow shop sequencing problem
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Modified simulated annealing algorithms for the flow shop sequencing problem
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Restricted neighborhood in the tabu search for the flowshop problem
- An SA/TS mixture algorithm for the scheduling tardiness problem
- The job shop scheduling problem: Conventional and new solution techniques
- The generalized shifting bottleneck procedure
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A fast tabu search algorithm for the permutation flow-shop problem
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Fuzzy sets and operations research: Perspectives
- A two-machine permutation flow shop scheduling problem with buffers
- A new constructive heuristic for the flowshop scheduling problem
- Some results of the worst-case analysis for flow shop scheduling
- A tabu search approach for the flow shop scheduling problem
- Applications of modern heuristic search methods to pattern sequencing problems
- Heuristics for the flow line problem with setup costs
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- Combinatorial optimization techniques for spacecraft scheduling automation
- Unrelated parallel machine scheduling using local search
- The three-machine flow-shop problem with arbitrary precedence relations
- A genetic algorithm for flowshop sequencing
- Genetic algorithms and tabu search: Hybrids for optimization
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Heuristic procedures for minimizing makespan and the number of required pallets
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- Sequencing of jobs in some production system
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- The flow shop with parallel machines: A tabu search approach
- Performance enhancements to tabu search for the early/tardy scheduling problem
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- An effective heuristic algorithm for the partial shop scheduling problem
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- Flow shop scheduling problem with conflict graphs
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- Parallel hybrid heuristics for the permutation flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Heuristics for scheduling in a flow shop with multiple processors
- Heuristics for permutation flow shop scheduling with batch setup times
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Handling flexibility in a ``generalised job shop with a fuzzy approach
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- Flow-shop scheduling with flexible processors
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- A comparison of local search methods for flow shop scheduling
- Parallel local search
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- 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
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterative beam search algorithms for the permutation flowshop
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- A cutoff time strategy based on the coupon collector's problem
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A sorting based efficient heuristic for pooled repair shop designs
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Benchmarks for basic scheduling problems
- A user's guide to tabu search
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Evaluating parallel simulated evolution strategies for VLSI cell placement
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Hierarchical minimization of completion time variance and makespan in jobshops
- Some aspects of scatter search in the flow-shop problem
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
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)
