scispace - formally typeset
Open AccessJournal ArticleDOI

The assembly of printed circuit boards: a case with multiple machines and multiple board types

Yves Crama, +3 more
- 01 May 1997 - 
- Vol. 98, Iss: 3, pp 457-472
TLDR
A solution procedure based on a hierarchical decomposition of the planning problem of the assembly of printed circuit boards, taking into account as much as possible the individual board type characteristics (as well as the machine characteristics) is proposed.
About: 
This article is published in European Journal of Operational Research.The article was published on 1997-05-01 and is currently open access. It has received 87 citations till now. The article focuses on the topics: Job shop scheduling & Assignment problem.

read more

Figures
Citations
More filters
Journal ArticleDOI

On the approximability of an interval scheduling problem

Frits C. R. Spieksma
- 01 Sep 1999 - 
TL;DR: In this article, the authors consider a general interval scheduling problem and show that unless =, this maximization problem cannot be approximated in polynomial time within arbitrarily good precision, and present a simple greedy algorithm that delivers a solution with a value of at least 1/2 times the value of an optimal solution.
Journal ArticleDOI

Production planning problems in printed circuit board assembly

Yves Crama, +2 more
- 15 Nov 2002 - 
TL;DR: The paper reviews the literature on this topic with an emphasis on the most recent developments on the fundamental structure of the mathematical models and on the relation between these models and some 'environmental' variables such as the layout of the shop or the product mix.
Journal ArticleDOI

A survey of surface mount device placement machine optimisation: Machine classification

Masri Ayob, +1 more
- 01 May 2008 - 
TL;DR: This paper surveys the characteristics of the various machine technologies and classifies them into five categories (dual-delivery, multi-station, turret-type,multi-head and sequential pick-and-place), based on their specifications and operational methods.
Proceedings ArticleDOI

Approximation algorithms for the job interval selection problem and related scheduling problems

Julia Chuzhoy, +1 more
TL;DR: The authors consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications, and shows an approximation guarantee of less than 1.582 for arbitrary instances of JISP.
Journal ArticleDOI

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Julia Chuzhoy, +2 more
- 01 Nov 2006 - 
TL;DR: This paper shows an approximation guarantee of less than 1.582 for arbitrary instances of JISP, a best approximation guarantee known, even for throughput maximization on a single machine.
References
More filters
Book

Network Flows

Ravindra K. Ahuja, +2 more
TL;DR: The question the authors are trying to ask is: how many units of water can they send from the source to the sink per unit of time?

Lectu re Notes in Economics and Mathematical Systems

M. Beckmann, +1 more
Journal ArticleDOI

Models arising from a flexible manufacturing machine, Part I: minimization of the number of tool switches

Christopher S. Tang, +1 more
- 01 Sep 1988 - 
TL;DR: This paper considers a job scheduling problem for a flexible manufacturing machine and considers one performance criterion: minimize the total number of tool switches, adequate for situations where the tool switching time is proportional to the number oftool switches.
Journal ArticleDOI

Sequencing of Insertions in Printed Circuit Board Assembly

Michael O. Ball, +1 more
- 01 Apr 1988 - 
TL;DR: In this article, the problem of determining the best sequence of insertion operations is formulated as a type of directed postman problem and an algorithm is developed for the problem that yields an optimal solution under certain conditions and approximate solutions, with a constant performance bound, when these conditions are relaxed.
Journal ArticleDOI

Models arising from a flexible manufacturing machine, Part II: minimization of the number of switching instants

Christopher S. Tang, +1 more
- 01 Sep 1988 - 
TL;DR: This paper presents a non-LP-based branch-and-bound procedure that terminates with an optimal solution to the job scheduling problem for a flexible manufacturing machine, and extends this procedure to the case of K machines in sequence.
Related Papers (5)

Machine setup and component placement in printed circuit board assembly

Jonathan F. Bard, +2 more
- 01 Jan 1994 - 

Automated process planning for printed circuit card assembly

Leon F. McGinnis, +7 more
- 01 Sep 1992 - 

Sequencing of Insertions in Printed Circuit Board Assembly

Michael O. Ball, +1 more
- 01 Apr 1988 - 

Optimization of the movements of a component placement machine

Timo Leipälä, +1 more
- 25 Jan 1989 - 

Production planning problems in printed circuit board assembly

Yves Crama, +2 more
- 15 Nov 2002 - 
Frequently Asked Questions (4)
Q1. What are the contributions mentioned in the paper "The assembly of printed circuit boards: a case with multiple machines and multiple board types" ?

In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The authors propose a solution procedure based on a hierarchical decomposition of the planning problem. It turns out that, in terms of the makespan, the authors can substantially improve the current solutions. 

The authors would like to thank Mr. Voogt and Mr. Driessen of Philips NV for their cooperation and for their willingness to provide us with data and explanations. 

There are a number of assembly-lines, each consisting of a number of placement machines which place electronic components on bare boards. 

An entry in this column has two numbers: "NoC" is the number of components of the speci c board type placed by that machine, and "time" equals the number of seconds it takes to place these components by this machine.