Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System
碩士 === 國立勤益科技大學 === 流通管理系 === 103 === To cope with intensified global competition and escalating customer demand for superior service, Just-in-time production system has become a competitive strategy for many companies. According to the principle of Just-in-time production system, a company prod...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/95842480013291686893 |
id |
ndltd-TW-103NCIT5691004 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NCIT56910042016-09-11T04:09:13Z http://ndltd.ncl.edu.tw/handle/95842480013291686893 Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System 及時生產系統下多共同交貨時窗作業排程研究 Suh-Jenq Yang 楊肅正 碩士 國立勤益科技大學 流通管理系 103 To cope with intensified global competition and escalating customer demand for superior service, Just-in-time production system has become a competitive strategy for many companies. According to the principle of Just-in-time production system, a company producing orders (or jobs) early, as well as late, is discouraged. This study considers multiple common due-windows assignment and scheduling problems with general position-dependent and resource-dependent processing times simultaneously in a Just-in-time production system. Multiple common due-windows allow a job to fit one from multiple common due-windows. We assume that the number of common due-windows to be assigned to the jobs is given. In this study two resource allocation models are examined, namely the linear resource consumption model and the convex resource consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. The goal of the study is to determine jointly the optimal common due-window positions and sizes, the set of jobs assigned to each common due-window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due-windows assignment, makespan, and resource consumption costs. We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered. We also present two numerical examples to illustrate applying algorithms proposed in the study for understanding the effect of various parameters on the optimal solution. The results of the study can be used in scheduling on distribution management, such as restaurant service, orders picking operation process in a distribution center, or replenishment operations in a hypermarket. Chien-Jung Lai 賴建榮 2015 學位論文 ; thesis 52 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立勤益科技大學 === 流通管理系 === 103 === To cope with intensified global competition and escalating customer demand for superior service, Just-in-time production system has become a competitive strategy for many companies. According to the principle of Just-in-time production system, a company producing orders (or jobs) early, as well as late, is discouraged. This study considers multiple common due-windows assignment and scheduling problems with general position-dependent and resource-dependent processing times simultaneously in a Just-in-time production system. Multiple common due-windows allow a job to fit one from multiple common due-windows. We assume that the number of common due-windows to be assigned to the jobs is given.
In this study two resource allocation models are examined, namely the linear resource consumption model and the convex resource consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. The goal of the study is to determine jointly the optimal common due-window positions and sizes, the set of jobs assigned to each common due-window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due-windows assignment, makespan, and resource consumption costs.
We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered. We also present two numerical examples to illustrate applying algorithms proposed in the study for understanding the effect of various parameters on the optimal solution. The results of the study can be used in scheduling on distribution management, such as restaurant service, orders picking operation process in a distribution center, or replenishment operations in a hypermarket.
|
author2 |
Chien-Jung Lai |
author_facet |
Chien-Jung Lai Suh-Jenq Yang 楊肅正 |
author |
Suh-Jenq Yang 楊肅正 |
spellingShingle |
Suh-Jenq Yang 楊肅正 Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
author_sort |
Suh-Jenq Yang |
title |
Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
title_short |
Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
title_full |
Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
title_fullStr |
Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
title_full_unstemmed |
Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System |
title_sort |
scheduling with multiple common due-windows assignment in a just-in-time production system |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/95842480013291686893 |
work_keys_str_mv |
AT suhjenqyang schedulingwithmultiplecommonduewindowsassignmentinajustintimeproductionsystem AT yángsùzhèng schedulingwithmultiplecommonduewindowsassignmentinajustintimeproductionsystem AT suhjenqyang jíshíshēngchǎnxìtǒngxiàduōgòngtóngjiāohuòshíchuāngzuòyèpáichéngyánjiū AT yángsùzhèng jíshíshēngchǎnxìtǒngxiàduōgòngtóngjiāohuòshíchuāngzuòyèpáichéngyánjiū |
_version_ |
1718383784869494784 |