A Simplified Branch-and-Price Mechanism for a Three-Machine Dynamic PCB Assembly

M.T. Yazdani Sabouni; Rasaratnam Logendran

doi:10.4028/www.scientific.net/AMM.598.398

Paper Titles

Development of the Multimethod Genetic Algorithm for the Strip Packing Problem
p.377

Automatic Discovery Approach of Digital Image Topic
p.382

Multilevel Linked Data Structure for the Multidimensional Orthogonal Packing Problem
p.387

Fuzzy Classification Maximum Likelihood Clustering with T-Distributions
p.392

A Simplified Branch-and-Price Mechanism for a Three-Machine Dynamic PCB Assembly
p.398

Fast Calculation of Bayesian Unconditional Cramer-Rao Bounds in Case the State-Vector is Constant
p.404

The Coupling of RBF and FDM for Solving Higher Order Fractional Partial Differential Equations
p.409

Equating Heteroclinic Orbits in Chen System by Using Scaling Logarithm Change Series (SLS) Method
p.414

A Fractal Mutation Factor Modified Differential Evolution Algorithm
p.418

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 598A Simplified Branch-and-Price Mechanism for a...

A Simplified Branch-and-Price Mechanism for a Three-Machine Dynamic PCB Assembly

Abstract:

A dynamic Printed Circuit Board (PCB) assembly system along with the most complete form of setup time in this assembly is introduced in this paper. An effective Branch-and-Price mechanism is employed to develop a lower bound for the three-machine problem. However, solving the sub problems remains computationally difficult because of their NP-hard nature. An optimal approach is established, which makes solving the sub problems computationally feasible.

You might also be interested in these eBooks

Advanced Materials, Mechanics and Industrial Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 598)

Pages:

398-403

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.598.398

Citation:

Cite this paper

Online since:

July 2014

Authors:

M.T. Yazdani Sabouni*, Rasaratnam Logendran

Keywords:

Branch-and-Price, Carryover Sequence-Dependent Setups, Group Scheduling, Lower Bound, PCB Manufacturing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] C.A. Gelogullari, R. Logendran, Group-scheduling problems in electronics manufacturing, Journal of Scheduling. 13 (2010) 177-202.

DOI: 10.1007/s10951-009-0147-3

Google Scholar

[2] C. Barnhart, E. Johnson, G. Newhauser, M. Savelsbergh, P. Vance, Branch-and-price: column generation for solving huge integer programs, Operations Research. 46 (1998) 316-329.

DOI: 10.1287/opre.46.3.316

Google Scholar

[3] W.E. Wilhelm, A technical review of column generation in integer programming, Optimization and Engineering. 2 (2001) 159-200.

Google Scholar

[4] W.E. Wilhelm, P. Damodaran, J. Li, Prescribing the content and timing of product upgrades, IIE Transactions. 35 (2003) 647-664.

DOI: 10.1080/07408170304359

Google Scholar

[5] F. Vanderbeck, On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, Operations Research. 48 (2000) 111-128.

DOI: 10.1287/opre.48.1.111.12453

Google Scholar

[6] C.A. Gelogullari, Group scheduling problems in electronics manufacturing (Doctoral dissertation), Oregon State University, Oregon, USA, (2005).

Google Scholar

[7] J. Du, J.Y.T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research. 15 (1999) 483-495.

DOI: 10.1287/moor.15.3.483

Google Scholar

[8] M.T. Yazdani Sabouni, R. Logendran, An efficient branch-and-price approach for a dynamic PCB assembly, to be presented at the 23nd Annual Industrial and Systems Engineering Research Conference (ISERC), Montreal, Canada, May (2014).

Google Scholar

[9] ILOG CPLEX, IBM, Version 12. 2. (2009).

Google Scholar