Dispatching rule for non-identical parallel machines with sequence-dependent setups and quality restrictions
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ko, Hyo-Heon | - |
dc.contributor.author | Kim, Jihyun | - |
dc.contributor.author | Kim, Sung-Shick | - |
dc.contributor.author | Baek, Jun-Geol | - |
dc.date.accessioned | 2021-09-07T23:50:55Z | - |
dc.date.available | 2021-09-07T23:50:55Z | - |
dc.date.issued | 2010-10 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.issn | 1879-0550 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/115580 | - |
dc.description.abstract | This paper proposes a dispatching rule that guarantees a predetermined minimum quality level for nonidentical parallel machines with multiple product types. Manufacturers are focusing on improving the overall quality of their products, as the demand for top quality products is increasing. Such changes increase the possibility of neglecting another crucial factor in manufacturing schedules, namely due date. Traditionally, jobs are dispatched with the focus on meeting due dates. That is, jobs are assigned to machines without consideration of product quality. This approach opens the possibility of manufacturing poor quality products. Realizing the shortcomings of the existing dispatching rules, manufacturers are tempted to dispatch jobs with the objective of maximizing product quality. With such an attempt, jobs are likely to be assigned to high performance machines only. In turn, waiting times will increase and job delays are inevitable. This research proposes a dispatching rule that satisfies both criteria, reducing due date delays, while ensuring a predefined product quality level. A quality index is introduced to standardize various product qualities. The index is used to ensure a predetermined quality level, whilst minimizing product delays. Simulations compare various dispatch methods, evaluating them based on mean tardiness and product quality. (C) 2010 Elsevier Ltd. All rights reserved. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Dispatching rule for non-identical parallel machines with sequence-dependent setups and quality restrictions | - |
dc.type | Article | - |
dc.publisher.location | 영국 | - |
dc.identifier.doi | 10.1016/j.cie.2010.05.017 | - |
dc.identifier.scopusid | 2-s2.0-77955470307 | - |
dc.identifier.wosid | 000281133200009 | - |
dc.identifier.bibliographicCitation | COMPUTERS & INDUSTRIAL ENGINEERING, v.59, no.3, pp 448 - 457 | - |
dc.citation.title | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.citation.volume | 59 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 448 | - |
dc.citation.endPage | 457 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.subject.keywordPlus | PRODUCTION SYSTEM | - |
dc.subject.keywordPlus | DUE-DATES | - |
dc.subject.keywordPlus | TIMES | - |
dc.subject.keywordPlus | REWORK | - |
dc.subject.keywordPlus | SHOP | - |
dc.subject.keywordPlus | JOBS | - |
dc.subject.keywordPlus | TARDINESS | - |
dc.subject.keywordPlus | MINIMIZE | - |
dc.subject.keywordAuthor | Quality assurance | - |
dc.subject.keywordAuthor | Quality index | - |
dc.subject.keywordAuthor | Dispatching algorithm | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Rework | - |
dc.subject.keywordAuthor | Parallel machines | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.