On the part inventory model sequencing problem: complexity and beam search heuristic
From MaRDI portal
(Redirected from Publication:633549)
Recommendations
- Using beam search techniques for sequencing mixed-model assembly lines
- A beam search approach for the optimization version of the car sequencing problem
- Mixed-model assembly line sequencing using beam search
- Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Sequencing mixed-model assembly lines to minimize part inventory cost
- Some efficient heuristic methods for the flow shop sequencing problem
- Mixed-model assembly line sequencing heuristics for smoothing component parts usage: A comparative analysis
- A search heuristic for the sequence-dependent economic lot scheduling problem
- A partition approach to the inventory/routing problem
Cites work
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Level scheduling of mixed-model assembly lines under storage constraints
- Minimizing variation of production rates in just-in-time systems: A survey
- Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage
- Sequencing mixed-model assembly lines to minimize part inventory cost
- Sequencing mixed-model assembly lines: survey, classification and model critique
- Solving real car sequencing problems with ant colony optimization
Cited in
(3)
This page was built for publication: On the part inventory model sequencing problem: complexity and beam search heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633549)