SMT production scheduling: a generalized transportation approach

Ji, Ping; Wong, Yoke San; Loh, Han Tong; Lee, L. C.

doi:10.1080/00207549408957070

Cited by 10 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ji et al (1994) and Chiu et al (1991) use this approach with two di erent techniques. Ji et al (1994) present a generalized transportation model which is developed from the revised simplex method, also providing an e cient algorithm for the dual, but do not address the speci® c capabilities of the X-Y positioning table. Chiu et al (1991) address the problem slightly di erently by analysing a`mounting-sequence' problem as it pertains to a generalized machine design.…”

Section: Literature Reviewmentioning

confidence: 99%

Development of the surface mount assembly process through an angular board orientation

Moyer¹,

Gupta²

1998

International Journal of Production Research

View full text Add to dashboard Cite

Development of the surface mount assembly process through an angular board orientationL. K. MOYER² and S. M. GUPTA² * This paper proposes a methodology to improve the process time required for the component placement process of the printed circuit board assembly with an X-Y positioning table. The methodology is applied to a previously published subproblem as well as a real-lif e working board con® guration. Even with high speed assembly machines placing in excess of 40 000 components per hour (cph), process improvements are possible. Concentrating on the path planning portion is a valid method to increase e ciency, but as the problem approaches optimality, the planning process essentially becomes counterproductive due to the time and e ort required. This paper presents an algorithm for system time improvement for use after a board placement path is established. In order to take advantage of the machine's capability to move the positioning table along each axis simultaneously, the board is physically rotated with respect to the positioning table. This paper steps through the theoretical development of a method to determine the proper angle of rotation, ® rst for a regular rectangular' board con® guration, and then for a more applicable`general' con-® guration.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Development of the surface mount assembly process through an angular board orientation

Moyer¹,

Gupta²

1998

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…If the LP model LP3 is considered as the basis, and constraint set (5) is defined as the dual variable u i , and constraint set (2) as v j , then the dual of LP3 can be formulated as follows:…”

Section: Dual Problemmentioning

confidence: 99%

“…After a company has received a number of customer orders, for various boards with different quantities, it has to determine which assembly line to make which board, and the required quantities. This determination was formulated as a machine loading problem and can be solved using a generalised transportation model [2]. However, before the model is applied to this problem, the components in the board must be assigned to proper automatic placement machines to form groups, so the cycle time of the line can be determined.…”

Section: Introductionmentioning

confidence: 99%

Component Grouping for Automatic Printed Circuit Board Assembly

Sze

Lee

2002

Int J Adv Manuf Technol

Self Cite

View full text Add to dashboard Cite

This paper addresses a component grouping problem in an automatic printed circuit board (PCB) assembly line with several non-identical placement machines. After the problem is defined, an integer linear programming model is formulated with the objective of minimising the cycle time of the assembly line. The integer linear programming model can be solved by the general branch-and-bound (B&B) algorithm; however, it is not efficient. So, the integer linear programming model is relaxed as a linear programming formulation because a nearoptimal solution is acceptable in the real situation. A new algorithm is developed for the dual of the linear programming model. To demonstrate the efficiency of this algorithm, an example is presented and compared with its integer solution from a commercial package, CPLEX.

show abstract

“…It was stated that the PAPA works better on a sparse than a dense problem, and it also performs well on fewer side constraints. Ji et al [14] developed an algorithm for the dual form of the GTP from the idea of the revised simplex method. The algorithm is similar to the revised simplex method except the computation equations and procedure.…”

Section: Introductionmentioning

confidence: 99%

A genetic algorithm for the generalised transportation problem

2005

IJCAT

Self Cite

View full text Add to dashboard Cite

The Generalized Transportation Problem (GTP) is an extension of the linear Hitchcock transportation problem. However, it does not have the unimodularity property, which means the linear programming solution (like the Simplex Method) can not guarantee to be integer. This is a major difference between the GTP and the Hitchcock transportation problem. Although some special algorithms, such as the generalized stepping-stone method, have been developed, but they are based on the linear programming model and the integer solution requirement of the GTP is relaxed. This paper proposes a Genetic Algorithm (GA) to solve the GTP and a numerical example is presented to show the algorithm and its efficiency.

show abstract

SMT production scheduling: a generalized transportation approach

Cited by 10 publications

References 9 publications

Development of the surface mount assembly process through an angular board orientation

Development of the surface mount assembly process through an angular board orientation

Component Grouping for Automatic Printed Circuit Board Assembly

A genetic algorithm for the generalised transportation problem

Contact Info

Product

Resources

About