Aggregate line capacity design for PWB assembly systems

DOI10.1080/00207540050031841MaRDI QIDQ4510498zbMATH OpenOpenAlexFDO

Authors Zhong-Sheng Hua, Prashant Banerjee

Publication date 9 December 2001

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

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

zbMATH Keywords

line capacity designprinted wiring boardproduction planningPWB

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Review text

In a multi-product, flexible manufacturing environment, line capacity of Printed Wiring Board (PWB) assembly systems may need to be adjusted at the beginning of each aggregate planning period because of demand fluctuation over multiple periods. A model of production planning and equipment changeover scheduling at the aggregate level is developed. In the described model, three kinds of equipment changeover methods, i.e adding machine, removing machine and transfering machine, are involved. Because the model is a large-scale integer programming problem, it cannot be solved directly. A solution approach is developed, which first solves a recursive linear programming problem to obtain a rough set of machines to be added and a rough set of machines to be removed for each machine line in each period, then applies a branch and bound heuristic to the rough sets to obtain near-optimal solutions to the equipment changeover scheduling problem. Computational studies show the financial benefit both on capital cost and equipment changeover costs.

Recommendations

• scientific article; zbMATH DE number 1935514
• Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
• Balancing printed circuit board assembly line systems
• Workload planning in small lot printed circuit board assembly
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line

Cited in

(9)

• An efficient compact quadratic convex reformulation for general integer quadratic programs
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
• A new variable reduction technique for convex integer quadratic programs
• An effective genetic algorithm approach to large scale mixed integer programming problems
• A variable-grouping based genetic algorithm for large-scale integer programming
• An approximate dynamic programming approach to convex quadratic knapsack problems
• Process flexibility with bill of material constraints
• Extending the QCR method to general mixed-integer programs
• Reducing the number of variables in integer quadratic programming problem

This page was built for publication: Aggregate line capacity design for PWB assembly systems

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