Scheduling of drilling operations in printed circuit board factory

Authors:
Jih-Chang Hsieh;Pei-Chann Chang;Lich-Chao Hsu
Affiliations:
Department of Industrial Management, Van Nung Institute of Technology, Chung-Li, Tao-Yuan, Taiwan;Department of Industrial Engineering and Management, Yuan-Ze University, 135 Yuan-Tung Road, Nei-Li, Tao Yuan 32026, Taiwan, ROC;Department of Industrial Engineering and Management, Yuan-Ze University, 135 Yuan-Tung Road, Nei-Li, Tao Yuan 32026, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 9
Cited 7

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Heuristics for scheduling unrelated parallel machines

Computers and Operations Research
Bicriteria scheduling problem for unrelated parallel machines

Computers and Industrial Engineering
A tabu search approach to optimization of drilling operations

CIE '96 Proceedings of the 19th international conference on Computers and industrial engineering
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence

Computers and Industrial Engineering
Tabu Search

Tabu Search
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Mathematical and Computer Modelling: An International Journal

Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry

Applied Soft Computing
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

Computers and Operations Research
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers and Operations Research
Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

Computers and Industrial Engineering
Two-phase sub population genetic algorithm for parallel machine-scheduling problem

Expert Systems with Applications: An International Journal
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The drilling operation of the printed circuit board is very critical and usually is a bottleneck operation of the whole manufacturing processes. Therefore the scheduling problem of the drilling operation is very challenging and difficult because usually there are more than 50 machines on the shop floor waiting to be sequenced. The shop orders are all different based on their application purpose such as in PC industries, or telecommunication applications, i.e. the cellular phones. These orders have to be sequenced on the drilling machines and the objective of this research is to schedule these drilling operations in a near optimal manner under various constraints. Due to the complexity of this problem, a heuristic approach, i.e. the tabu search, is applied to provide a practical solution within a timely manner. Experimental results are examined to test the efficiency and effectiveness of the tabu search. When compared with the manual approach provided by the shop floor scheduler, the tabu search outperforms significantly.