Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

DOI10.1080/00207540802154845MaRDI QIDQ3055267zbMATH OpenOpenAlexFDO

Authors Selin Özpeynirci, Meral Azizoğlu

Publication date 7 November 2010

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

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

zbMATH Keywords

beam searchbranch and boundcapacity allocationflexible manufacturing systemstool assignment

Mathematics Subject Classification ID

Production models (90B30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
• Capacity and tool allocation problem in flexible manufacturing systems
• A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
• A new formulation of operation allocation problem in flexible manufacturing systems: mathematical modelling and computational experience
• A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems

Cites work

• A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
• A capacity allocation problem with integer side constraints
• A heuristic solution approach to the machine loading problem of an FMS and its Petri net model
• A loading and dispatching problem in a random flexible manufacturing system
• An effective part-selection model for production planning of flexible manufacturing systems
• An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems
• Assignment of tools to machines in a flexible manufacturing system
• Capacity allocation with machine duplication in semiconductor manufacturing
• Capacity and tool allocation problem in flexible manufacturing systems
• Due date and cost-based FMS loading, scheduling and tool management
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Multiperiod tool and production assignment in flexible manufacturing systems
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Short-term capacity allocation problem with tool and setup constraints
• Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach
• Tool capacity planning in semiconductor manufacturing.

Cited in

(9)

• Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
• Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions
• A new formulation of operation allocation problem in flexible manufacturing systems: mathematical modelling and computational experience
• Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm
• Capacity and tool allocation problem in flexible manufacturing systems
• A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
• Using Constraint Satisfaction Approach to Solve the Capacity Allocation Problem for Photolithography Area
• A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
• Formulations of the capacity planning problem considering manufacturing flexibility

This page was built for publication: Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055267)