• Journal of Korean Society for Quality Management
• /
• v.19 no.2
• /
• pp.125-132
• /
• 1991

This paper is concerned with the flow shop scheduling problems considering different weighted penalty costs for earliness and lateness, and a common due date. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty costs and for determining the optimal common due date. The positional weight index and, the product sum method are used. A numerical example is given for illustrating the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.7-12
• /
• 2006

This study considers the problem of scheduling jobs on uniform 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 is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.1-11
• /
• 1986

This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.29-36
• /
• 2013

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

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

This paper considers scheduling a set of n-jobs on m-paraller identical processors in which all jobs have the common due date. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such common due dates under the assumption that each job has a different weight. and to determine the optimal value of a common due date. We propose four heuristic solution methods based on several dominance conditions, and its solution procedure is illustrated with numerical examples. The Performance comparison is made among four heuristic scheduling procedures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.25
• /
• pp.23-31
• /
• 1992

This paper is concerned with an n jobs one machine Job shop scheduling problems in which all jobs have a common due date and unequal penalties occur when a job is completed before or after due date. The objective is to determine an optimal sequence and the corresponding common due date that yield the global minimum value of a penalty function Then a sequence that minimize the penalty function globally is a V-shaped sequence Using the idea of linear equations and a LGP(Linear Goal Programming), this paper shows that LGP and MAD(Mean Absolute Deviation) are equivalent problems. Therefore an efficient algorithm that is developed for MAD problem holds for LGP problem and vice-versa. A numerical example to account for the algorithm is provided.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.1-12
• /
• 2012

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

• 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.

• 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.