DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.contributor.author | Lim, HG | ko |
dc.contributor.author | Park, MW | ko |
dc.date.accessioned | 2008-10-07T08:58:35Z | - |
dc.date.available | 2008-10-07T08:58:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1996-05 | - |
dc.identifier.citation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.91, no.1, pp.124 - 143 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7524 | - |
dc.description.abstract | 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. | - |
dc.description.sponsorship | This research is supported by the Korean Science and Engineering Foundation (KOSEF) under grant 941-1000-015-1. | en |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | MINIMIZING MEAN TARDINESS | - |
dc.subject | SHOP SEQUENCING PROBLEM | - |
dc.subject | DEPENDENT SETUP TIMES | - |
dc.subject | TABU SEARCH | - |
dc.subject | N-JOB | - |
dc.subject | MILP MODEL | - |
dc.subject | M-MACHINE | - |
dc.subject | 2-MACHINE | - |
dc.subject | ALGORITHM | - |
dc.subject | OPTIMIZATION | - |
dc.title | Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process | - |
dc.type | Article | - |
dc.identifier.wosid | A1996UP57900010 | - |
dc.identifier.scopusid | 2-s2.0-0000814799 | - |
dc.type.rims | ART | - |
dc.citation.volume | 91 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 124 | - |
dc.citation.endingpage | 143 | - |
dc.citation.publicationname | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Lim, HG | - |
dc.contributor.nonIdAuthor | Park, MW | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | heuristics | - |
dc.subject.keywordAuthor | taboo search | - |
dc.subject.keywordAuthor | simulated annealing | - |
dc.subject.keywordAuthor | PCB assembly | - |
dc.subject.keywordPlus | MINIMIZING MEAN TARDINESS | - |
dc.subject.keywordPlus | SHOP SEQUENCING PROBLEM | - |
dc.subject.keywordPlus | DEPENDENT SETUP TIMES | - |
dc.subject.keywordPlus | TABU SEARCH | - |
dc.subject.keywordPlus | N-JOB | - |
dc.subject.keywordPlus | MILP MODEL | - |
dc.subject.keywordPlus | M-MACHINE | - |
dc.subject.keywordPlus | 2-MACHINE | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.