Heuristics for the flow line problem with setup costs
From MaRDI portal
Publication:1303708
DOI10.1016/S0377-2217(97)00213-0zbMath0948.90070OpenAlexW1999879286MaRDI QIDQ1303708
Roger Z. Ríos-Mercado, Jonathan F. Bard
Publication date: 27 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00213-0
sequence-dependent setup timesflowshop schedulingmakespan minimization objectivetwo-phase lower bounding scheme
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ Packing items to feed assembly lines ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. ⋮ General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ 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 ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ A review of TSP based approaches for flowshop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- The two-machine sequence dependent flowshop scheduling problem
- A new heuristic method for the flow shop sequencing problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An adaptive branching rule for the permutation flow-shop problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- Two branch and bound algorithms for the permutation flow shop problem
- A decision support system for the resource constrained project scheduling problem
- The flow shop scheduling polyhedron with setup times
- Greedy randomized adaptive search procedures
- A restricted Lagrangean approach to the traveling salesman problem
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- A GRASP for the Vehicle Routing Problem with Time Windows
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
This page was built for publication: Heuristics for the flow line problem with setup costs
