×

Optimal common due-date with limited completion time deviation. (English) Zbl 0635.90050

Given a set of n jobs with deterministic processing times and the same ready times, the problem is to find the optimal common flow allowance \(k^*\) for the common due-date assignment method, and the optimal job sequence \(\sigma^*\) to minimize a penalty function of missing due- dates. It is assumed that penalty will not occur if the deviation of job completion from the due-date is sufficiently small. Three lemmas are presented and a numerical example is provided to illustrate the use of the results to determine the optimal solution to the due-date determination and sequencing problem.

MSC:

90B35 Deterministic scheduling theory in operations research
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Conway, R. W., Priority dispatching and job lateness in a job shop, J. Indust. Engng, 16, 228-237 (1965)
[2] Eilon, S.; Chowhury, I. J., Due-dates in job shop scheduling, Int. J. Productn Res., 14, 223-237 (1976)
[3] Weeks, J. K.; Fryer, J. S., A simulation study of operating policies in a hypothetical dual-constrained job shop, Mgmt Sci., 22, 1362-1371 (1976) · Zbl 0328.90040
[4] Weeks, J. K., A simulation study of predictable due-dates, Mgmt Sci., 25, 363-373 (1979) · Zbl 0409.90041
[5] Baker, K. R., Sequencing rules and due-date assignment in a job shop, Mgmt Sci., 30, 1093-1104 (1984)
[6] Cheng, T. C.E., Optimal due-date assignment in a job shop, Int. J. Productn Res., 24, 503-515 (1986) · Zbl 0585.90048
[7] Kanet, J. J., Minimizing the average deviation of job completion times about a common due-date, Naval Res. Logist. Q., 28, 634-651 (1981) · Zbl 0548.90037
[8] Seidmann, A.; Smith, M. L., Due-date assignment for production systems, Mgmt Sci., 27, 571-581 (1981) · Zbl 0456.90038
[9] Seidmann, A.; Panwalker, S. S.; Smith, M. L., Optimal assignment of due-dates for a single processor scheduling problem, Int. J. Productn Res., 19, 393-399 (1981)
[10] Panwalker, S. S.; Smith, M. L.; Seidmann, A., Common due-date assignment to minimize total penalty for the one machine scheduling problem, Opns Res., 30, 391-399 (1982) · Zbl 0481.90042
[11] Cheng, T. C.E., Optimal due-date determination and sequencing of n jobs on a single machine, J. Opl Res. Soc., 35, 433-437 (1984) · Zbl 0532.90049
[12] Cheng, T. C.E., Analytical determination of optimal TWK due-dates in a job shop, Int. J. Syst. Sci., 16, 777-787 (1985) · Zbl 0575.90031
[13] Cheng, T. C.E., A duality approach to optimal due-date determination, Engng Optim., 9, 127-130 (1985)
[14] Cheng, T. C.E., On optimal common due-date determination, . IMA J. Math. Mgmt, 1, 39-43 (1986) · Zbl 0622.90048
[15] Cheng, T. C.E., Minimizing the average deviation of job completion times about a common due-date: an extension, Math. Modelg, 9, 13-15 (1987) · Zbl 0631.90033
[16] Hall, N. G., Single- and multi-processor models for minimizing completion time variance, Naval Res. Logist. Q., 33, 49-54 (1986) · Zbl 0599.90057
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.