DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.contributor.author | Joo, Byung-Jun | ko |
dc.contributor.author | Shin, Jong-Ho | ko |
dc.date.accessioned | 2013-03-09T18:13:34Z | - |
dc.date.available | 2013-03-09T18:13:34Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2009-02 | - |
dc.identifier.citation | JOURNAL OF HEURISTICS, v.15, no.1, pp.19 - 42 | - |
dc.identifier.issn | 1381-1231 | - |
dc.identifier.uri | http://hdl.handle.net/10203/97098 | - |
dc.description.abstract | This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while there is a single batch-processing machine at the second stage. Ready times of the jobs (at the first stage) may be different, and a given product-mix ratio of job types should be kept in each batch at the second stage. We present three types of heuristic algorithms: forward scheduling algorithms, backward scheduling algorithms, and iterative algorithms. To evaluate performance of the suggested algorithms, a series of computational experiments are performed on randomly generated test problems and results are reported. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.subject | BATCH-PROCESSING MACHINE | - |
dc.subject | MINIMIZING TOTAL TARDINESS | - |
dc.subject | PARALLEL MACHINES | - |
dc.subject | COMPLETION-TIME | - |
dc.subject | GENETIC ALGORITHM | - |
dc.subject | BACKWARD APPROACH | - |
dc.subject | BOUND ALGORITHM | - |
dc.subject | MAKESPAN | - |
dc.subject | STAGE | - |
dc.subject | SHOP | - |
dc.title | Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint | - |
dc.type | Article | - |
dc.identifier.wosid | 000262434800002 | - |
dc.identifier.scopusid | 2-s2.0-58149498856 | - |
dc.type.rims | ART | - |
dc.citation.volume | 15 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 19 | - |
dc.citation.endingpage | 42 | - |
dc.citation.publicationname | JOURNAL OF HEURISTICS | - |
dc.identifier.doi | 10.1007/s10732-007-9061-z | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Shin, Jong-Ho | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Heuristics | - |
dc.subject.keywordAuthor | Hybrid flowshop | - |
dc.subject.keywordAuthor | Product-mix ratio | - |
dc.subject.keywordAuthor | Makespan | - |
dc.subject.keywordPlus | BATCH-PROCESSING MACHINE | - |
dc.subject.keywordPlus | MINIMIZING TOTAL TARDINESS | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | COMPLETION-TIME | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | BACKWARD APPROACH | - |
dc.subject.keywordPlus | BOUND ALGORITHM | - |
dc.subject.keywordPlus | MAKESPAN | - |
dc.subject.keywordPlus | STAGE | - |
dc.subject.keywordPlus | SHOP | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.