A new heuristic method for the flow shop sequencing problem
From MaRDI portal
Recommendations
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic for the n-job, M-machine flow-shop problem
- A high quality solution constructive heuristic for flow shop sequencing
- An efficient heuristic approach to the scheduling of jobs in a flowshop
Cites work
Cited in
(86)- Modified simulated annealing algorithms for the flow shop sequencing problem
- Finding a feasible course schedule using Tabu search
- Restricted neighborhood in the tabu search for the flowshop problem
- Two branch and bound algorithms for the permutation flow shop problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- The job shop scheduling problem: Conventional and new solution techniques
- 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 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
- Heuristics for the flow line problem with setup costs
- Deterministic job-shop scheduling problems with capacity focus
- Unrelated parallel machine scheduling using local search
- Genetic algorithms and tabu search: Hybrids for optimization
- The tabu search metaheuristic: How we used it
- Heuristics for scheduling in flowshop with multiple objectives
- Heuristic procedures for minimizing makespan and the number of required pallets
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Sequencing of jobs in some production system
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Performance enhancements to tabu search for the early/tardy scheduling problem
- The hot strip mill production scheduling problem: A tabu search approach
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Heuristics for permutation flow shop scheduling with batch setup times
- 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
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- On a scheduling problem in a robotized analytical system
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- A comparison of local search methods for flow shop scheduling
- Metaheuristics: A bibliography
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- A tabu search experience in production scheduling
- Routing and scheduling in a flexible job shop by tabu search
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Solving the maximum clique problem using a tabu search approach
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Some aspects of scatter search in the flow-shop problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A review of TSP based approaches for flowshop scheduling
- Two-stage hybrid flow shop with recirculation
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- Forward backward transformation
- On the resources allocation problem
- Multipath adaptive tabu search for a vehicle control problem
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling
- Scheduling in flowshops to minimize total tardiness of jobs
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- Sequencing CONWIP flow-shops: Analysis and heuristics
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- Experimental comparison of heuristics for flow shop scheduling
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Scheduling of multiple in-line steppers for semiconductor wafer fabs
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- Flowshop-scheduling problems with makespan criterion: a review
- A fast method for heuristics in large-scale flow shop scheduling
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Fifty years of metaheuristics
- Scheduling flow shops using differential evolution algorithm
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Two-machine flow shop problems with a single server
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A bicriteria flowshop scheduling with a learning effect
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- An improved particle swarm optimization algorithm for flowshop scheduling problem
This page was built for publication: A new heuristic method 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 Q1119464)
