• 산업경영시스템학회지
• /
• 제16권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.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.183-199
• /
• 2007

In this paper we research the problem in which the objective is to minimize the sum of squared deviations of job expected completion times from the due date, and the job processing times are stochastic. In the problem the machine is subject to stochastic breakdowns and all jobs are preempt-repeat. In order to show that the replacing ESSD by SSDE is reasonable, we discuss difference between ESSD function and SSDE function. We first give an express of the expected completion times for both cases without resampling and with resampling. Then we show that the optimal sequence of the problem V-shaped with respect to expected occupying time. A dynamic programming algorithm based on the V-shape property of the optimal sequence is suggested. The time complexity of the algorithm is pseudopolynomial.

• 대한산업공학회지
• /
• 제21권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.

• Journal of applied mathematics & informatics
• /
• 제26권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.

• 한국연소학회:학술대회논문집
• /
• 한국연소학회 2002년도 제25회 KOSCI SYMPOSIUM 논문집
• /
• pp.173-184
• /
• 2002

In order to evaluate the devolatilization models of pulverized coal, various devolatilization models are examined for the numerical analysis of Drop Tube Furnace.The results of analysis are compared with the experimental results. A numerical study was conducted to explore the sensitivities of the predictions to variation of the model parameters. It helps to elucidate the source of the discrepancies. Three different wall temperature conditions of the DTF, 1100, 1300 and $1500^{\circ}C$ were considered in this analysis. Two fuels are U.S.A. Alaska coal and Australia Drayton coal. The results of analysis with constant rate model, single kinetic rate model and two competing rate modes well presented fast volatile matter release in the early devolatilization. However, in the latter devolatilization they did not coincide with experimental results which presented tardy volatile matter release on account of pyrolysis of high molecular substance. On the other hand, the results of analysis with DAEM(Distribute Activation Energy Model) coincided with experiment al results in overall devolatilization.