An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal

DOI10.1080/00207540903289730zbMath1197.90184MaRDI QIDQ3163160

Mesut Yavuz

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540903289730

zbMATH Keywords

heuristics; beam search; NP-hard; just-in-time; production smoothing

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

Cites Work

• A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
• Using beam search techniques for sequencing mixed-model assembly lines
• A transformed two-stage method for reducing the part-usage variation and a comparison of the product-level and part-level solutions in sequencing mixed-model assembly lines
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Minimizing variation of production rates in just-in-time systems: A survey
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• A parametric procedure for multicriterion sequence scheduling for JustIn-Time mixed-model assembly lines
• Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches
• Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems