A hybrid meta-heuristic for the batching problem in just-in-time flow shops

DOI10.1007/S10852-005-9035-9zbMath1156.90356OpenAlexW2051109114MaRDI QIDQ864936

Suleyman Tufekci, Elif Akcali, Mesut Yavuz

Publication date: 13 February 2007

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9035-9

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (2)

A hybrid meta-heuristic for the batching problem in just-in-time flow shops ⋮ Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A hybrid meta-heuristic for the batching problem in just-in-time flow shops
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Nurse scheduling with tabu search and strategic oscillation
• Future paths for integer programming and links to artificial intelligence
• Metaheuristics: A bibliography
• Large-scale controlled rounding using tabu search with strategic oscillation
• Principles of scatter search
• A path relinking approach with ejection chains for the generalized assignment problem
• A GRASP and path relinking heuristic for rural road network development
• GRASP with Path Relinking for Three-Index Assignment
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Experiments with a strategic oscillation algorithm for the pallet loading problem
• Analysis and solution to the single-level batch production smoothing problem

This page was built for publication: A hybrid meta-heuristic for the batching problem in just-in-time flow shops