Heuristics for the flow line problem with setup costs
From MaRDI portal
Recommendations
- Scheduling flexible flow lines with sequence-dependent setup times
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- A new heuristic and dominance relations for no-wait flowshops with setups
Cites work
- A decision support system for the resource constrained project scheduling problem
- A GRASP for the Vehicle Routing Problem with Time Windows
- A new heuristic method for the flow shop sequencing problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A restricted Lagrangean approach to the traveling salesman problem
- An adaptive branching rule for the permutation flow-shop problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 4074791 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Some efficient heuristic methods for the flow shop sequencing problem
- The flow shop scheduling polyhedron with setup times
- The two-machine sequence dependent flowshop scheduling problem
- Two branch and bound algorithms for the permutation flow shop problem
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Cited in
(19)- An heuristic algorithm for the production line layout problem
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- Scheduling flexible flow lines with sequence-dependent setup times
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Packing items to feed assembly lines
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A bi-objective coordination setup problem in a two-stage production system
- A review of TSP based approaches for flowshop scheduling
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
- Fifty years of metaheuristics
This page was built for publication: Heuristics for the flow line problem with setup costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1303708)
