DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이준호 | ko |
dc.contributor.author | 김현정 | ko |
dc.date.accessioned | 2022-06-08T01:00:10Z | - |
dc.date.available | 2022-06-08T01:00:10Z | - |
dc.date.created | 2022-06-08 | - |
dc.date.issued | 2021-12 | - |
dc.identifier.citation | 한국SCM학회지, v.21, no.3, pp.1 - 12 | - |
dc.identifier.issn | 1598-382X | - |
dc.identifier.uri | http://hdl.handle.net/10203/296849 | - |
dc.description.abstract | We examine a three-machine flow shop scheduling problem in which two overlapping waiting time limits exist between the first and second machines and the first and third machines, respectively. The objective is to minimize the total completion time. We first present a mixed integer linear programming (MILP) to mathematically model the problem and obtain optimal solutions. Due to the high computational complexity of the problem, large-sized problems cannot be solved by the MILP within a reasonable computation time. We therefore develop a heuristic scheduling method based on the genetic algorithm. Finally, the performance of the proposed algorithm is numerically tested. | - |
dc.language | Korean | - |
dc.publisher | 한국SCM학회 | - |
dc.title | 총완료시간 최소화를 위한 3-설비 중첩 대기시간 제약 플로우샵 스케줄링 | - |
dc.title.alternative | 3-Machine Flow Shop Scheduling with Overlapping Waiting Time Constrains to Minimize Total Completion Time | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 21 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 1 | - |
dc.citation.endingpage | 12 | - |
dc.citation.publicationname | 한국SCM학회지 | - |
dc.identifier.doi | 10.25052/KSCM.2021.12.21.3.1 | - |
dc.identifier.kciid | ART002793609 | - |
dc.contributor.localauthor | 김현정 | - |
dc.contributor.nonIdAuthor | 이준호 | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Genetic Algorithm | - |
dc.subject.keywordAuthor | Flow Shop | - |
dc.subject.keywordAuthor | Waiting Time Constraint | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.