On the part inventory model sequencing problem: complexity and beam search heuristic

DOI10.1007/s10951-010-0214-9zbMath1208.90004OpenAlexW2035595752MaRDI QIDQ633549

Armin Scholl, Nils Boysen, Malte Fliedner

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00016227

zbMATH Keywords

sequencingmixed-model assembly linebeam Searchcomplexity proofconsignment stock

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Sequencing mixed-model assembly lines to minimize part inventory cost
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• 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
• Solving real car sequencing problems with ant colony optimization
• Level scheduling of mixed-model assembly lines under storage constraints
• Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage

This page was built for publication: On the part inventory model sequencing problem: complexity and beam search heuristic