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

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• 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 문제에서 최적의 공통 납기를 결정하는 방법을 개발한다. 스케줄과 허용 오차가 주어질 때, 최적의 납기를 찾는 두 개의 선형시간이 소요되는 알고리즘을 제시한다. 주어진 허용오차 중 하나는 가장 짧은 가공시간을 가지는 작업의 절반보다 작은 경우이며 다른 하나는 허용오차가 임의인 경우이다.

• Management Science and Financial Engineering
• /
• v.18 no.2
• /
• pp.5-11
• /
• 2012

In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.143-151
• /
• 1990

This paper studies a single machine scheduling problem in which all jobs have the common due date and penalties are assessed for jobs at different rates. The scheduling objective is to minimize the weighted mean absolute deviations(WMAD). This problem may provide greater flexibility in achieving scheduling objectives than the mean absolute deviation (MAD) problem. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. This article extends the results to the problem to the problem of scheduling n-jobs on m-parallel identical processors in order to minimize the weighted mean absolute deviation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.3-16
• /
• 1995

JIT manufacturing requires that materials and services should be done neither too early nor tardy. Therefore, related jobs have to be performed just-in-time. In this paper, we consider a problem of determining a schedule of jobs with a common due date. The objective is to minimize the squared deviation of complete times from the due date. An artificial neural network which is based on the mean field theory is proposed for the problem. Computational results obtained from computer simulations show that the network performs very well.

• Asian-Australasian Journal of Animal Sciences
• /
• v.15 no.5
• /
• pp.671-674
• /
• 2002

This study investigated the use of multinutrient blocks (MNB) composed of 35% date syrup, 35% date syrup byproducts, 10% date fronds, 7% urea, 7% cement and 6% common salt for growing small ruminants, as partial substitute for the roughage component of the diet (Rhodes grass hay) and its effect on feedlot performance and economics of feeding. Eight growing local Omani goats and 8 sheep (each about one year old) were used in this study. Mean body weights for goats and sheep (kg), respectively were $21.1{\pm}4.5$ and $25.5{\pm}4.1$. The goats and sheep were subdivided into two sub-groups of more or less equal body weights for each species. Each sub-group in both species was either fed on 0.5 kg concentrate+ad libitum Rhodes grass hay or the same diet+restricted hay (about 0.2 kg/head/day) and ad libitum amount of MNB. Sheep significantly (p<0.05) consumed greater amounts of MNB ($36{\pm}17$g/head/day) than goats ($6{\pm}2.5$ g/head/day). Feeding of the MNB was effective in sparing about 40% of the roughage Rhodes grass hay for goats (from 240 to 140 g) and about 42% for sheep (from 252 to 146 g) or approximately 100 g/head/day for both goats and sheep. This reduction (or sparing) in the consumption of Rhodes grass hay was coupled by an improvement in daily liveweight gain (g/head/day) in both goats (from 29 to 46 by 58.6%) and sheep (from 26 to 39 by 50%) and also by an improvement in the feed conversion efficiency (g feed/g gain) of both goats (from 25 to 13.8 by 45%) and sheep (from 28.7 to 17.2 by 40%). Cost of daily consumed feeds as well as cost/kg gain (or cost of meat) were both reduced due to feeding of MNB. They were both respectively reduced by 7.5% (from 53 Baisa/day to 49) and 38% (from 1,828 Baisa/kg to 1,140). It was economically viable to feed MNBs containing date by-products and urea to small ruminants in the Sultanate of Oman.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.90-93
• /
• 2000

This paper presents job scheduling for non-identical parallel machines using Simulated Annealing (SA). The scheduling problem accounts for allotting work parts of L lots into M parallel machines, where each lot is composed of N homogeneous jobs. Some lots may have different jobs while every job within each lot has common due date. Each machine has its own performance and set up time according to the features of the machine, and also by job types. A meta-heuristic, SA, is applied in this study to determine the job sequences of the scheduling problem so as to minimize total tardiness of due. The SA method is compared with a conventional steepest descent(SD) algorithm that is a typical tool for finding local optimum. The comparison shows the SA is much better than the SD in terms tardiness while SA takes longer , but acceptable time.