article

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Author:

Dvir ShabtayAuthors Info & Claims

Computers and Operations Research, Volume 35, Issue 5

Pages 1539 - 1545

https://doi.org/10.1016/j.cor.2006.08.017

Published: 01 May 2008 Publication History

Abstract

We study three different due date assignment problems in scheduling a single machine which differ from each other based upon the objective function and due date assignment method being used. Two different objective functions are considered. The first is a cost function that includes earliness, tardiness and due date assignment penalties and the second is a function that includes penalties due to the number of tardy jobs and due date assignments. We assume that the earliness, tardiness and due date assignment penalties are continuous and non-decreasing functions of the corresponding duration. The goal is to minimize each objective function for two different due date assignment methods. The first is a method in which the assigned due dates are restricted to be equal while the second is a method that allows us to assign different due dates to different jobs.

References

[1]

Baker, K.R. and Scudder, G.D., Sequencing with earliness and tardiness penalties: a review. Operations Research. v38. 22-36.

Digital Library

[2]

Seidmann, A., Panwalkar, S.S. and Smith, M.L., Optimal assignment of due dates for a single processor scheduling problem. International Journal of Production Research. v19. 393-399.

[3]

Panwalkar, S.S., Smith, M.L. and Seidmann, A., Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research. v30. 391-399.

[4]

Bagchi, U., Sullivan, R.S. and Chang, Y.L., Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics. v33. 227-240.

[5]

Bagchi, U., Sullivan, R.S. and Chang, Y.L., Minimizing mean squared deviation of completion times about a common due date. Management Science. v33. 894-906.

Digital Library

[6]

De, P., Ghosh, J.B. and Wells, C.E., Optimal delivery time quotation and order sequencing. Decision Sciences. v22. 379-390.

[7]

Kahlbacher, H.G. and Cheng, T.C.E., Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Applied Mathematics. v47. 139-164.

Digital Library

[8]

Cheng, T.C.E. and Kovalyov, M.Y., Batch scheduling and common due-date assignment on a single machine. Discrete Applied Mathematics. v70. 231-245.

Digital Library

[9]

Mosheiov, G., A common due-date assignment problem on parallel identical machines. Computers and Operations Research. v28 i8. 719-732.

Digital Library

[10]

Birman, M. and Mosheiov, G., A note on due-date assignment in a two-machine flow-shop. Computers and Operations Research. v31 i3. 473-480.

Digital Library

[11]

Gordon, V., Proth, J.M. and Chu, C.B., A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research. v139. 1-25.

[12]

Kubiak, W., Completion time variance minimization on a single machine is difficult. Operations Research Letters. v14. 49-59.

Digital Library

[13]

Shabtay D, Steiner G. Two due date assignment problems in scheduling a single machine. Operations Research Letters 2006; 34(6):683-91.

Digital Library

[14]

Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics. v5. 287-326.

[15]

Du, J.Y. and Leung, T., Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. v15. 483-495.

Digital Library

[16]

Moore, J.M., An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science. v15. 102-109.

Cited By

Zhao CHsu CCheng SYin YWu C(2014)Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobsApplied Mathematics and Computation10.1016/j.amc.2014.09.095248:C(503-510)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1016/j.amc.2014.09.095
Gerstl EMosheiov G(2013)Due-window assignment problems with unit-time jobsApplied Mathematics and Computation10.1016/j.amc.2013.05.045220(487-495)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.amc.2013.05.045
Li JYuan XLee EXu D(2011)Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machineComputers & Mathematics with Applications10.1016/j.camwa.2011.09.06362:11(4126-4139)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1016/j.camwa.2011.09.063
Show More Cited By

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Recommendations

Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

e consider a single-machine batch delivery scheduling and common due date assignment problem. In addition to making decisions on sequencing the jobs, determining the common due date, and scheduling job delivery, we consider the option of performing a ...
Common due date assignment and scheduling with ready times

We consider the problem of scheduling a set of nonsimultaneously available jobs on one machine. Each job has a ready time only at or after which the job can be processed. All the jobs have a common due date, which needs to be determined. The problem is ...
Two due date assignment problems in scheduling a single machine

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Operations Research

Computers and Operations Research Volume 35, Issue 5

May, 2008

380 pages

ISSN:0305-0548

Issue’s Table of Contents

Copyright © Elsevier Ltd © 2006.

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 May 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhao CHsu CCheng SYin YWu C(2014)Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobsApplied Mathematics and Computation10.1016/j.amc.2014.09.095248:C(503-510)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1016/j.amc.2014.09.095
Gerstl EMosheiov G(2013)Due-window assignment problems with unit-time jobsApplied Mathematics and Computation10.1016/j.amc.2013.05.045220(487-495)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.amc.2013.05.045
Li JYuan XLee EXu D(2011)Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machineComputers & Mathematics with Applications10.1016/j.camwa.2011.09.06362:11(4126-4139)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1016/j.camwa.2011.09.063
Shabtay DSteiner GYedidsion L(2010)Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environmentsDiscrete Applied Mathematics10.1016/j.dam.2010.02.010158:10(1090-1103)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1016/j.dam.2010.02.010
Li JSun KXu DLi H(2010)Single machine due date assignment scheduling problem with customer service level in fuzzy environmentApplied Soft Computing10.1016/j.asoc.2009.10.00210:3(849-858)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.asoc.2009.10.002

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents