Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이동호 | - |
dc.date.accessioned | 2018-07-25T08:10:57Z | - |
dc.date.available | 2018-07-25T08:10:57Z | - |
dc.date.issued | 2011-11 | - |
dc.identifier.citation | International Journal of Production Research. Nov2011, Vol. 49 Issue 22, P.6885-6903. 19p. | en_US |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.issn | 1366-588X | - |
dc.identifier.uri | https://www.tandfonline.com/doi/full/10.1080/00207543.2010.507609 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/72945 | - |
dc.description.abstract | This paper considers the job scheduling problem in which jobs are grouped into job families, but they are processed individually. The decision variable is the sequence of the jobs assigned to each machine. This type of job shop scheduling can be found in various production systems, especially in remanufacturing systems with disassembly, reprocessing and reassembly shops. In other words, the reprocessing shop can be regarded as the job shop with job families since it performs the operations required to bring parts or sub-assemblies disassembled back to like-new condition before reassembling them. To minimise the deviations of the job completion times within each job family, we consider the objective of minimising the total family flow time. Here, the family flow time implies the maximum among the completion times of the jobs within a job family. To describe the problem clearly, a mixed integer programming model is suggested and then, due to the complexity of the problem, two types of heuristics are suggested. They are: (a) priority rule based heuristics; and (b) meta-heuristics. Computational experiments were performed on a number of test instances and the results show that some priority rule based heuristics are better than the existing ones. Also, the meta-heuristics improve the priority rule based heuristics significantly. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Department of Industrial Engineering, Hanyang University, Korea | en_US |
dc.subject | job families | en_US |
dc.subject | job shop scheduling | en_US |
dc.subject | meta-heuristics | en_US |
dc.subject | priority rules | en_US |
dc.subject | total family flow time | en_US |
dc.title | Scheduling algorithms to minimise the total family flow time for job shops with job families | en_US |
dc.type | Article | en_US |
dc.relation.no | 22 | - |
dc.relation.volume | 49 | - |
dc.identifier.doi | 10.1080/00207543.2010.507609 | - |
dc.relation.page | 6885-6903 | - |
dc.relation.journal | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.contributor.googleauthor | Yu, Jae-Min | - |
dc.contributor.googleauthor | Kim, Ji-Su | - |
dc.contributor.googleauthor | Lee, Dong-Ho | - |
dc.contributor.googleauthor | 유재민 | - |
dc.contributor.googleauthor | 김지수 | - |
dc.contributor.googleauthor | 이동호 | - |
dc.relation.code | 2011204303 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL ENGINEERING | - |
dc.identifier.pid | leman | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.