Minimizing makespan on an \(m\)-machine re-entrant flowshop
From MaRDI portal
Publication:2459401
DOI10.1016/j.cor.2006.09.028zbMath1211.90080OpenAlexW2079217767MaRDI QIDQ2459401
Publication date: 6 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.028
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Practical solutions for a dock assignment problem with trailer transportation ⋮ Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm ⋮ Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop
Cites Work
- A survey of very large-scale neighborhood search techniques
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Minimizing makespan in re-entrant permutation flow-shops
- Minimizing makespan on a two-machine re-entrant flowshop
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
