DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, GC | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2008-11-04T08:08:16Z | - |
dc.date.available | 2008-11-04T08:08:16Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-11 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.42, pp.4731 - 4743 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7753 | - |
dc.description.abstract | A two-stage hybrid flowshop-scheduling problem is considered with the objective of minimizing total tardiness of jobs. In the hybrid flowshop, there is one machine at the first stage and multiple identical parallel machines at the second stage. Dominance properties and lower bounds are developed for the problem and a branch-and-bound algorithm is suggested using them. Results of computational experiments show that the suggested algorithm can find optimal solutions for problems with up to 15 jobs in a reasonable amount of central processing unit time. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.subject | 2-MACHINE FLOWSHOP | - |
dc.subject | PARALLEL MACHINES | - |
dc.subject | SHOP | - |
dc.subject | MINIMIZATION | - |
dc.subject | TIME | - |
dc.title | A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness | - |
dc.type | Article | - |
dc.identifier.wosid | 000225564200005 | - |
dc.identifier.scopusid | 2-s2.0-9744269106 | - |
dc.type.rims | ART | - |
dc.citation.volume | 42 | - |
dc.citation.beginningpage | 4731 | - |
dc.citation.endingpage | 4743 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.identifier.doi | 10.1080/0020754041233127044 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Lee, GC | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | 2-MACHINE FLOWSHOP | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | SHOP | - |
dc.subject.keywordPlus | MINIMIZATION | - |
dc.subject.keywordPlus | TIME | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.