An improved branch and bound procedure for scheduling a flow line manufacturing cell

DOI10.1080/00207540500185216zbMATH Open1095.90045OpenAlexW1966953613MaRDI QIDQ5478802FDOQ5478802

Authors: Jeffrey E. Schaller 

Publication date: 13 July 2006

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

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

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

zbMATH Keywords

schedulingbranch-and-boundsequencingflowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A survey and evaluation of static flowshop scheduling heuristics
• An Evaluation of Flow Shop Sequencing Heuristics
• Title not available (Why is that?)
• A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell

Cited In (3)

• A comprehensive review of flowshop group scheduling literature
• A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
• Minimizing flow time in a flow-line manufacturing cell with family setup times

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)