Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11390
Title: A scheduling problem for PCB assembly : a case with multiple lines
Authors: Wu, Y
Ji, P 
Keywords: Genetic algorithm
Parallel-machine scheduling problem
Printed circuit board assembly
Scheduling problem
Issue Date: 2009
Publisher: Springer
Source: International journal of advanced manufacturing technology, 2009, v. 43, no. 11-12, p. 1189-1201 How to cite?
Journal: International journal of advanced manufacturing technology 
Abstract: A production scheduling problem for printed circuit board (PCB) assembly with multiple lines is addressed. The investigated problem is to schedule a set of PCB assembly jobs with different ready times and due dates on multiple assembly lines, with the objective to minimize the sum of total weighted tardiness of jobs and weighted makespan. The feature that each job can be completed by different lines with different process times makes the problem a special type of unrelated parallel-machine scheduling problem (PMSP) with special constraints and a unique objective. A mixed-integer linear programming model for the problem is established and verified through solving some small-sized problem instances to optimality. In order to solve the real-world problems, a steady-state genetic algorithm with an improved replacement strategy is proposed. Experimental tests and a case study are conducted to examine the usefulness and effectiveness of the approach.
URI: http://hdl.handle.net/10397/11390
ISSN: 0268-3768
EISSN: 1433-3015
DOI: 10.1007/s00170-008-1797-6
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
1
Citations as of Aug 21, 2017

Page view(s)

24
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.