316 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이동호-
dc.date.accessioned2018-07-25T08:10:57Z-
dc.date.available2018-07-25T08:10:57Z-
dc.date.issued2011-11-
dc.identifier.citationInternational Journal of Production Research. Nov2011, Vol. 49 Issue 22, P.6885-6903. 19p.en_US
dc.identifier.issn0020-7543-
dc.identifier.issn1366-588X-
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/00207543.2010.507609-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/72945-
dc.description.abstractThis 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.isoenen_US
dc.publisherDepartment of Industrial Engineering, Hanyang University, Koreaen_US
dc.subjectjob familiesen_US
dc.subjectjob shop schedulingen_US
dc.subjectmeta-heuristicsen_US
dc.subjectpriority rulesen_US
dc.subjecttotal family flow timeen_US
dc.titleScheduling algorithms to minimise the total family flow time for job shops with job familiesen_US
dc.typeArticleen_US
dc.relation.no22-
dc.relation.volume49-
dc.identifier.doi10.1080/00207543.2010.507609-
dc.relation.page6885-6903-
dc.relation.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH-
dc.contributor.googleauthorYu, Jae-Min-
dc.contributor.googleauthorKim, Ji-Su-
dc.contributor.googleauthorLee, Dong-Ho-
dc.contributor.googleauthor유재민-
dc.contributor.googleauthor김지수-
dc.contributor.googleauthor이동호-
dc.relation.code2011204303-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL ENGINEERING-
dc.identifier.pidleman-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE