• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.64
• /
• pp.53-62
• /
• 2001

In make-to-order manufacturing, if orders are processed and promise first-served base, then the urgent orders from important customers in .practice, orders are not confirmed upon receipt; and delayed as uncertainty of due date causes significant waste of cost and time. propose a new concept of reserved capacity as an alternative to accommodate the urgent orders from important customers, while the due dale of all of orders arrival; and suggest a flew operational policies.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.125-134
• /
• 2000

Keeping the promised delivery date for a customer order is crucial for a company to promote customer satisfaction and generate further businesses. For this, a company should be able to quote the delivery date that can be achieved with the capacity available on the shop floor. In a dynamic make-to-order manufacturing environment, the problem of determining a delivery date for an incoming order with consideration of resource capacity, workload, and finished-product inventory can hardly be solved by an analytical solution procedure. This paper considers a situation in which a delivery date for a customer order is determined based on a job schedule, and presents the SimTriD algorithm that provides the best scheduling for determining a delivery date of customer order through the job schedule that efficiently utilizes manufacturing resources with consideration of interacting factors such as resource utilization, finished-product inventory, and due date.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.81-92
• /
• 1990

This paper considers a scheduling of a set of jobs on single and multiple processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. The objective is to determine the optimal value of a common due date and an optimal scheduling to minimize a total penalty function. It is also shown that a schedule having minimum weighted completion time variances must be V-shaped. For identical processors, a polynomial scheduling algorithm with the secondary objectives of minimizing makespan and machine occupancy is developed and a numerical example is presented.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.889-900
• /
• 2008

The problem of scheduling n jobs on a single machine is considered when the machine is subject to stochastic breakdowns. The objective is to minimize the weighted squared deviation of job completion times from a common due date. Two versions of the problem are addressed. In the first one the common due date is a given constant, whereas in the second one the common due date is a decision variable. In each case, a general form of deterministic equivalent of the stochastic scheduling problem is obtained when the counting process N(t) related to the machine uptimes is a Poisson process. It is proved that an optimal schedule must be V-shaped in terms of weighted processing time when the agreeable weight condition is satisfied. Based on the V-shape property, two dynamic programming algorithms are proposed to solve both versions of the problem.

• Korean Management Science Review
• /
• v.30 no.2
• /
• pp.133-141
• /
• 2013

In this paper, we considers the outsourcing decision problem in a single machine scheduling problem. The decision problem is to determine for each job whether to be processed on an in-house manufacturing or external facilities(outsourcing). Moreover, this paper considers a situation where each job has a due date. The objective of the problem is to minimize the outsourcing cost, subject to the due date constraints. The considered problem is proved to be NP-hard. Some solution properties and valid inequalities are derived, and an effective lower bound is derived based on the LP-relaxation. The results of experimental tests are presented to evaluate the performance of the suggested lower bound.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.1-9
• /
• 2008

JIT 생산시스템이 세계적으로 많은 회사에 적용됨에 따라 earliness와 tardiness의 페널티를 동시에 최소화하는 문제에 대한 많은 연구가 진행되어 왔다. 이 연구에서는 한정된 완료시간의 편차에 대해서는 페널티를 부과하지 않는, 즉 허용오차가 존재할 때, 공통의 납기로부터 평균제곱편차(MSD : Mean Squared Deviation)를 최소화하는 단일기계 문제를 다룬다. 허용오차가 존재하는 MSD 문제에서 최적의 공통 납기를 결정하는 방법을 개발한다. 스케줄과 허용 오차가 주어질 때, 최적의 납기를 찾는 두 개의 선형시간이 소요되는 알고리즘을 제시한다. 주어진 허용오차 중 하나는 가장 짧은 가공시간을 가지는 작업의 절반보다 작은 경우이며 다른 하나는 허용오차가 임의인 경우이다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.141-146
• /
• 2004

This research considers the problem of scheduling jobs on unrelated parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.

• Journal of the Korean Wood Science and Technology
• /
• v.34 no.6
• /
• pp.12-20
• /
• 2006

The objectives of this study were to identify the species of coffin woods excavated at Ma-jeon relic in Jeonju and to date this coffin using tree-ring method. Al coffin woods were identified as red pines, most possibly, Pinus densiflora S. et Z. Tree-ring dating provides a calender year to each ring and produces the cutting date, if the bark presents. Due to the presence of bark and complete latewood present, the cutting date of the tree for coffin turned out between A.D. 1637 autumn and 1638 spring. However, due to the seasoning and storage periods, actual coffin manufacturing and burial time may be a little different from the tree-ring date.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.27
• /
• pp.91-104
• /
• 1993

This paper is concerned with flow shop scheduling problems having the common due date. V-shape property is used for algorithms with early and tardy penalty cost. The objective of this paper is developing efficient heuristic scheduling algorithms for minimizing total penalty cost function and determining the optimal common due date. The between job delay and the work in process are considered for developing algorithms as penalty cost. Algorithms is simulated to analyze interrelated factors. A numerical example is given for illustrating the proposed algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.65-70
• /
• 1991

This paper is concerned with a flow-shop scheduling problem for all jobs having the common due date using V-Shape penalty cost function for earliness and lateness. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty cost function and for determining the optimal common due date. In addition, the between-job-delay for two machines are considered for developing the algorithm. A numerical example is given for illustrating the proposed algorithm.