An improved branch and bound procedure for scheduling a flow line manufacturing cell
From MaRDI portal
Publication:5478802
Recommendations
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A branch and bound algorithm for the flow-shop scheduling problem
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
- Improved Bounds for Flow Shop Scheduling
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell
- Scheduling flexible manufacturing cells using tabu search
- Scheduling in cellular manufacturing systems: an heuristic approach
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
Cites work
- scientific article; zbMATH DE number 4149877 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell
- A survey and evaluation of static flowshop scheduling heuristics
- An Evaluation of Flow Shop Sequencing Heuristics
- Optimal two- and three-stage production schedules with set-up time included
Cited in
(3)
This page was built for publication: An improved branch and bound procedure for scheduling a flow line manufacturing cell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5478802)