DC Field | Value | Language |
---|---|---|
dc.contributor.author | An, Young-Jin | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.contributor.author | Choi, Seong-Woo | ko |
dc.date.accessioned | 2016-07-06T04:18:10Z | - |
dc.date.available | 2016-07-06T04:18:10Z | - |
dc.date.created | 2016-06-08 | - |
dc.date.created | 2016-06-08 | - |
dc.date.issued | 2016-07 | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, v.71, pp.127 - 136 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/209469 | - |
dc.description.abstract | We consider a two-machine flowshop scheduling problem in which jobs should be processed on the second machine within a certain period of time after those jobs are completed on the first machine, and sequence-dependent setup times are required on the second machine. For the problem with the objective of minimizing makespan, we develop several dominance properties, lower bounds, and heuristic algorithms, and use these to develop a branch and bound algorithm. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test instances. Results of the experiments show that the suggested branch and bound algorithm can solve problems with up to 30 jobs in a reasonable amount of CPU time. (C) 2016 Elsevier Ltd. All rights reserved | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | DYNAMIC-PROGRAMMING APPROACH | - |
dc.subject | SHOP SCHEDULING PROBLEMS | - |
dc.subject | REENTRANT FLOWSHOP | - |
dc.subject | SALESMAN PROBLEM | - |
dc.subject | TOTAL TARDINESS | - |
dc.subject | MEAN TARDINESS | - |
dc.subject | ALGORITHM | - |
dc.subject | MACHINE | - |
dc.subject | HEURISTICS | - |
dc.subject | BRANCH | - |
dc.title | Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times | - |
dc.type | Article | - |
dc.identifier.wosid | 000374602800011 | - |
dc.identifier.scopusid | 2-s2.0-84958549843 | - |
dc.type.rims | ART | - |
dc.citation.volume | 71 | - |
dc.citation.beginningpage | 127 | - |
dc.citation.endingpage | 136 | - |
dc.citation.publicationname | COMPUTERS & OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/j.cor.2016.01.017 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | An, Young-Jin | - |
dc.contributor.nonIdAuthor | Choi, Seong-Woo | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Flowshop | - |
dc.subject.keywordAuthor | Branch and bound | - |
dc.subject.keywordAuthor | Limited waiting time | - |
dc.subject.keywordAuthor | Sequence-dependent setup time | - |
dc.subject.keywordPlus | DYNAMIC-PROGRAMMING APPROACH | - |
dc.subject.keywordPlus | SHOP SCHEDULING PROBLEMS | - |
dc.subject.keywordPlus | REENTRANT FLOWSHOP | - |
dc.subject.keywordPlus | SALESMAN PROBLEM | - |
dc.subject.keywordPlus | TOTAL TARDINESS | - |
dc.subject.keywordPlus | MEAN TARDINESS | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | MACHINE | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | BRANCH | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.