Analysis and solution to the single-level batch production smoothing problem

DOI10.1080/00207540600917542zbMath1128.90478OpenAlexW1965569954MaRDI QIDQ5438683

Mesut Yavuz, Suleyman Tufekci

Publication date: 24 January 2008

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

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

zbMATH Keywords

heuristicsNP-hardjust-in-timeproduction smoothingmixed-model productionlevel schedules

Mathematics Subject Classification ID

Production models (90B30)

Related Items (3)

A hybrid meta-heuristic for the batching problem in just-in-time flow shops ⋮ A multi-objective production smoothing model with compressible operating times ⋮ Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times

Cites Work

• A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
• A simple sequencing algorithm for mixed-model assembly lines in just-in- time production systems
• Minimizing variation of production rates in just-in-time systems: A survey
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Level Schedules for Mixed-Model, Just-in-Time Processes
• A parallel shortest augmenting path algorithm for the assignment problem

This page was built for publication: Analysis and solution to the single-level batch production smoothing problem