Dominance Conditions for Optimal Order-Lot Matching in the Make-To-Order Production System
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jae-Gon | - |
dc.contributor.author | Bang, June-Young | - |
dc.contributor.author | Jun, Hong-Bae | - |
dc.contributor.author | Shin, Jong-Ho | - |
dc.date.available | 2021-03-17T06:57:13Z | - |
dc.date.created | 2021-02-26 | - |
dc.date.issued | 2020-02 | - |
dc.identifier.issn | 2227-9717 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/11822 | - |
dc.description.abstract | Order-lot matching is the process of assigning items in lots being processed in the make-to-order production system to meet the due dates of the orders. In this study, an order-lot matching problem (OLMP) is considered to minimize the total tardiness of orders with different due dates. In the OLMP considered in this study, we need to not only determine the allocation of items to lots in the production facility but also generate a lot release plan for the given time horizon. We show that the OLMP can be considered as a special type of machine scheduling problem with many similarities to the single machine total tardiness scheduling problem (1 parallel to Sigma Ti). We suggest dominance conditions for the OLMP by modifying those for 1 parallel to Sigma Ti and a dynamic programming (DP) model based on the dominance conditions. With two example problems, we show that the DP model can solve small-sized OLMPs optimally. | - |
dc.publisher | MDPI | - |
dc.title | Dominance Conditions for Optimal Order-Lot Matching in the Make-To-Order Production System | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jun, Hong-Bae | - |
dc.identifier.doi | 10.3390/pr8020255 | - |
dc.identifier.scopusid | 2-s2.0-85080906952 | - |
dc.identifier.wosid | 000521167900095 | - |
dc.identifier.bibliographicCitation | PROCESSES, v.8, no.2 | - |
dc.relation.isPartOf | PROCESSES | - |
dc.citation.title | PROCESSES | - |
dc.citation.volume | 8 | - |
dc.citation.number | 2 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Chemical | - |
dc.subject.keywordPlus | TOTAL TARDINESS | - |
dc.subject.keywordPlus | SEMICONDUCTOR | - |
dc.subject.keywordPlus | ASSIGNMENT | - |
dc.subject.keywordPlus | DECOMPOSITION | - |
dc.subject.keywordPlus | ALLOCATION | - |
dc.subject.keywordPlus | POLICIES | - |
dc.subject.keywordAuthor | order-lot matching problem | - |
dc.subject.keywordAuthor | machine scheduling | - |
dc.subject.keywordAuthor | total tardiness | - |
dc.subject.keywordAuthor | dynamic programming | - |
dc.subject.keywordAuthor | dominance condition | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK 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.