| Summary: | 碩士 === 國立勤益科技大學 === 流通管理系 === 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.
|
|---|
