article

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

Authors:

Nicholas G. Hall,

Marc E. PosnerAuthors Info & Claims

Operations Research, Volume 39, Issue 5

Pages 836 - 846

Published: 01 October 1991 Publication History

Abstract

This paper and its companion Part II concern the scheduling of jobs with cost penalties for both early and late completion. In Part I, we consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled on a single processor around a common due date, d. We assume that d is not early enough to constrain the scheduling decision. The weight of a job does not depend on whether the job is early or late, but weights may vary between jobs. We prove that the recognition version of this problem is NP-complete in the ordinary sense. We describe optimality conditions, and present a computationally efficient dynamic programming algorithm. When the weights are bounded by a polynomial function of the number of jobs, a fully polynomial approximation scheme is given. We also describe four special cases for which the problem is polynomially solvable. Part II provides similar results for the unweighted version of this problem, where d is arbitrary.

References

[1]

ACHUTAN, N. R, J. GRABOWSKI AND J. B. SIDNEY. 1981. Optimal Flow-Shop Scheduling With Earliness and Tardiness Penalties. Opsearch 18, 117-138.

[2]

BAGCHI, U. 1989. Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems. Opns. Res. 37, 118-125.

Digital Library

[3]

BAGCHI, U., Y. L. CHANG AND R. S. SULLIVAN. 1987. Minimizing Absolute and Squared Deviations of Completion Times With Different Earliness and Tardiness Penalties and a Common Due Date. Naval Res. Logis. 34, 739-751.

[4]

BAGCHI, U., R. S. SULLIVAN AND Y. L. CHANG. 1986. Minimizing Mean Absolute Deviation of Completion Times About a Common Due Date. Naval Res. Logis. Quart. 33, 227-240.

[5]

BAGCHI, U., R. S. SULLIVAN AND Y. L. CHANG. 1987. Minimizing Mean Squared Deviation of Completion Times About a Common Due Date. Mgmt. Sci. 33, 894-906.

Digital Library

[6]

BAKER, K. R., AND G. D. SCUDDER. 1990. Sequencing With Earliness and Tardiness Penalties: A Review. Opns. Res. 38, 22-36.

Digital Library

[7]

BLUM, N., R. W. FLOYD, V. PRATT, R. L. RIVEST AND R. E. TARJAN. 1973. Time Bounds for Selection. J. Comput. Syst. Sci. 7, 448-461.

Digital Library

[8]

EILON, S., AND I. G. CHOWDHURY. 1977. Minimizing Waiting Time Variance in the Single Machine Problem. Mgmt. Sci. 23, 567-575.

Digital Library

[9]

EMMONS, H. 1987. Scheduling to a Common Due Date on Parallel Uniform Processors. Naval Res. Logis. 34, 803-810.

[10]

GAREY, M. R., AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.

[11]

GAREY, M. R., R. E. TARJAN AND G. T. WILFONG. 1988. One-Processor Scheduling With Symmetric Earliness and Tardiness Penalties. Math. Opns. Res. 13, 330-348.

Digital Library

[12]

HALL, N. G. 1986. Single and Multiple Processor Models for Minimizing Completion Time Variance. Naval Res. Logis. Quart. 33, 49-54.

[13]

HALL, N. G., W. KUBIAK AND S. P. SETHI. 1991. Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date. Opns. Res. 39, 847-856.

Digital Library

[14]

HENDERSON, B. 1982. Perspectives--Just In Time (JIT). Boston Consulting Group, Boston.

[15]

KANET, J. J. 1981. Minimizing the Average Deviation of Job Completion Times About a Common Due Date. Naval Res. Logis. Quart. 28, 643-651.

[16]

KUBIAK, W., S. LOU AND S. P. SETHI. 1990. Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems. Opns. Res. Letts. 9, 371-374.

Digital Library

[17]

LAKSHMINARAYAN, S., R. LAKSHMANAN, R. L. PAPINEAU AND R. ROCHETTE. 1978. Optimal Single-Machine Scheduling With Earliness and Tardiness Penalties. Opns. Res. 26, 1079-1082.

Digital Library

[18]

LAWLER, E. L., AND J. M. MOORE. 1969. A Functional Equation and Its Application to Resource Allocation and Sequencing Problems. Mgmt. Sci. 16, 77-84.

Digital Library

[19]

LENSTRA, J. K., A. H. G. RINNOOY KAN AND P. BRUCKER. 1977. Complexity of Machine Scheduling Problems. Annals Discrete Math. 1, 343-362.

[20]

Ow, P. S., AND T. E. MORTON. 1989. The Single Machine Early/Tardy Problem. Mgmt. Sci. 35, 177-191.

Digital Library

[21]

PAPADIMITRIOU, C. H., AND K. STEIGLITZ. 1982. Combinatorial Optimization. Prentice-Hall, Englewood ClifTs, NJ.

[22]

PORTEUS, E. L. 1985. Investing in Reduced Setups in the EOQ Model. Mgmt. Sci. 31, 998-1010.

Digital Library

[23]

SCHÖNHAGE, A., M. PATTERSON AND N. PIPPENGER. 1976. Finding the Median. J. Comput. Syst. Sci. 13, 184-199.

Digital Library

[24]

SIDNEY, J. B. 1977. Optimal Single-Machine Scheduling With Earliness and Tardiness Penalties. Opns. Res. 25, 62-69.

Digital Library

[25]

SUNDARARAGHAVAN, P. S., AND M. U. AHMED. 1984. Minimizing the Sum of Absolute Lateness in Single-Machine and Multimachine Scheduling. Naval Res. Logis. Quart. 31, 325-333.

[26]

Szwarc, W. 1989. Single Machine Scheduling to Minimize Absolute Deviation of Completion Times From a Common Due Date. Naval Res. Logis. 5, 663-674.

[27]

Tukey, J. W. 1971. Exploratory Data Analysis. Addison-Wesley, Reading, Mass.

Cited By

Li FChen ZTang L(2017)Integrated Production, Inventory and Delivery ProblemsINFORMS Journal on Computing10.1287/ijoc.2016.072629:2(232-250)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1287/ijoc.2016.0726
Rocholl JMönch L(2017)Genetic algorithms for a single-machine multiple orders per job scheduling problem with a common due date2017 13th IEEE Conference on Automation Science and Engineering (CASE)10.1109/COASE.2017.8256240(1038-1039)Online publication date: 20-Aug-2017
https://dl.acm.org/doi/10.1109/COASE.2017.8256240
Li ZChen HXu RLi X(2015)Earlinesstardiness minimization on scheduling a batch processing machine with non-identical job sizesComputers and Industrial Engineering10.1016/j.cie.2015.06.00887:C(590-599)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1016/j.cie.2015.06.008
Show More Cited By

Index Terms

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

Index terms have been assigned to the content through auto-classification.

Recommendations

Sequencing with Earliness and Tardiness Penalties: A Review

We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains ...
Minmax weighted earliness-tardiness with identical processing times and two competing agents

We study a single-machine scheduling problem with competing agents and identical jobs.We focus on minmax weighted deviations of completion times from a common due-date.An extension to asymmetric cost structure is addressed.All models are extended to a ...
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardiness, subject to agreeable due dates, i.e., a later release date corresponds to a later due date. We prove that the problem is NP-hard in the ordinary ...

Comments

Information & Contributors

Information

Published In

cover image Operations Research

Operations Research Volume 39, Issue 5

October 1991

166 pages

ISSN:0030-364X

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 October 1991

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li FChen ZTang L(2017)Integrated Production, Inventory and Delivery ProblemsINFORMS Journal on Computing10.1287/ijoc.2016.072629:2(232-250)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1287/ijoc.2016.0726
Rocholl JMönch L(2017)Genetic algorithms for a single-machine multiple orders per job scheduling problem with a common due date2017 13th IEEE Conference on Automation Science and Engineering (CASE)10.1109/COASE.2017.8256240(1038-1039)Online publication date: 20-Aug-2017
https://dl.acm.org/doi/10.1109/COASE.2017.8256240
Li ZChen HXu RLi X(2015)Earlinesstardiness minimization on scheduling a batch processing machine with non-identical job sizesComputers and Industrial Engineering10.1016/j.cie.2015.06.00887:C(590-599)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1016/j.cie.2015.06.008
Zheng FZhang EXu YHong W(2014)Competitive analysis for make-to-order scheduling with reliable lead time quotationJournal of Combinatorial Optimization10.1007/s10878-012-9502-y27:1(182-198)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1007/s10878-012-9502-y
Janiak AKwiatkowski TLichtenstein M(2013)Scheduling problems with a common due window assignmentInternational Journal of Applied Mathematics and Computer Science10.2478/amcs-2013-001823:1(231-241)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.2478/amcs-2013-0018
Sourd F(2009)New Exact Algorithms for One-Machine Earliness-Tardiness SchedulingINFORMS Journal on Computing10.1287/ijoc.1080.028721:1(167-175)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1287/ijoc.1080.0287
Müller-Hannemann MSonnikow A(2009)Non-approximability of just-in-time schedulingJournal of Scheduling10.1007/s10951-009-0120-112:5(555-562)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s10951-009-0120-1
Kaminsky PLee Z(2008)Effective on-line algorithms for reliable due date quotation and large-scale schedulingJournal of Scheduling10.1007/s10951-008-0053-011:3(187-204)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/s10951-008-0053-0
Wan G(2007)Single machine common due window scheduling with controllable job processing timesProceedings of the 1st international conference on Combinatorial optimization and applications10.5555/1779837.1779869(279-290)Online publication date: 14-Aug-2007
https://dl.acm.org/doi/10.5555/1779837.1779869
Cai XZhou X(2006)Stochastic Scheduling With Asymmetric Earliness And Tardiness Penalties Under Random Machine BreakdownsProbability in the Engineering and Informational Sciences10.1017/S026996480606039620:4(635-654)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1017/S0269964806060396
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents