Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process

Cited 60 time in webofscience Cited 0 time in scopus
  • Hit : 721
  • Download : 1
We consider a scheduling problem in a factory producing printed circuit boards (PCBs). The PCB assembly process in this factory can be regarded as a flowshop which has two special characteristics: jobs have sequence dependent setup times and each job consists of a lot (batch) of identical PCBs. Because of the latter characteristic, it is possible to start a job on a following machine before the job is entirely completed on a previous machine, that is, there is time-lag between machines. In this paper, we propose several heuristics, including taboo search (TS) and simulated annealing (SA) methods, for this generalized flowshop scheduling problem with the objective of minimizing mean tardiness. We compare suggested heuristics after series of tests to find appropriate values for parameters needed for the two search algorithms, TS and SA. Results of computational tests on randomly generated test problems are reported.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1996-05
Language
English
Article Type
Article
Keywords

MINIMIZING MEAN TARDINESS; SHOP SEQUENCING PROBLEM; DEPENDENT SETUP TIMES; TABU SEARCH; N-JOB; MILP MODEL; M-MACHINE; 2-MACHINE; ALGORITHM; OPTIMIZATION

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.91, no.1, pp.124 - 143

ISSN
0377-2217
URI
http://hdl.handle.net/10203/7524
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 60 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0