Skip to main content
Top
Published in: Journal of Applied Mathematics and Computing 4/2022

03-08-2021 | Original Research

The due date assignment scheduling problem with the deteriorating jobs and delivery time

Authors: Jin Qian, Haiyan Han

Published in: Journal of Applied Mathematics and Computing | Issue 4/2022

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper considers the single machine scheduling problem with three different due dates in which the actual processing time of the job is a simple deterioration function of the starting time. The goal is to minimize the total costs that contain the earliness, tardiness and due date. We prove that these problems are polynomial time solvable, and we propose the corresponding algorithms to obtain the optimal sequence and due date.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Jackson, J.R.: Scheduling a Production Line to Minimize Maximum Tardiness. Management Science Research Project, UCLA (1955) Jackson, J.R.: Scheduling a Production Line to Minimize Maximum Tardiness. Management Science Research Project, UCLA (1955)
2.
go back to reference Wang, X.Y., Wang, M.Z.: Single machine common flow allowance scheduling with a rate-modifying activity. Comput. Indus. Eng. 59(4), 898–902 (2010)CrossRef Wang, X.Y., Wang, M.Z.: Single machine common flow allowance scheduling with a rate-modifying activity. Comput. Indus. Eng. 59(4), 898–902 (2010)CrossRef
3.
go back to reference Li, S., Ng, C.T., Yuan, J.: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. Int. J. Prod. Econ. 131(2), 747–751 (2011)CrossRef Li, S., Ng, C.T., Yuan, J.: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. Int. J. Prod. Econ. 131(2), 747–751 (2011)CrossRef
4.
go back to reference Yin, Y.Q., Cheng, T.C.E., Wu, C.C., Cheng, S.R.: Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int. J. Prod. Res. 52(19), 5583–5596 (2014)CrossRef Yin, Y.Q., Cheng, T.C.E., Wu, C.C., Cheng, S.R.: Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int. J. Prod. Res. 52(19), 5583–5596 (2014)CrossRef
5.
go back to reference Zhao, C., Hsu, C.J., Cheng, S.R., Yin, Y., Wu, C.C.: Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs. Appl. Math. Comput. 248(1), 503–510 (2014)MathSciNetMATH Zhao, C., Hsu, C.J., Cheng, S.R., Yin, Y., Wu, C.C.: Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs. Appl. Math. Comput. 248(1), 503–510 (2014)MathSciNetMATH
6.
go back to reference Wang, D.J., Yin, Y., Cheng, S.R., Cheng, T.C.E., Wu, C.C.: Due date assignment and scheduling on a single machine with two competing agents. Int. J. Prod. Res. 54(4), 1152–1169 (2016)CrossRef Wang, D.J., Yin, Y., Cheng, S.R., Cheng, T.C.E., Wu, C.C.: Due date assignment and scheduling on a single machine with two competing agents. Int. J. Prod. Res. 54(4), 1152–1169 (2016)CrossRef
7.
go back to reference Li, S.S., Chen, R.X.: Common due date assignment and cumulative deterioration scheduling on a single machine. Eng. Optim. 49(6), 976–989 (2017)MathSciNetCrossRef Li, S.S., Chen, R.X.: Common due date assignment and cumulative deterioration scheduling on a single machine. Eng. Optim. 49(6), 976–989 (2017)MathSciNetCrossRef
8.
go back to reference Liu, C., Fan, Y., Zhao, C., Wang, J.: Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs. J. Indus. Manag. Optim. 13(2), 713–720 (2017)MathSciNetCrossRef Liu, C., Fan, Y., Zhao, C., Wang, J.: Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs. J. Indus. Manag. Optim. 13(2), 713–720 (2017)MathSciNetCrossRef
9.
go back to reference Karhi, S., Shabtay, D.: Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56(9), 3080–3096 (2018)CrossRef Karhi, S., Shabtay, D.: Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56(9), 3080–3096 (2018)CrossRef
11.
go back to reference Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Indus. Eng. 14(4), 387–393 (1998)CrossRef Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Indus. Eng. 14(4), 387–393 (1998)CrossRef
12.
go back to reference Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput. Indus. Eng. 21(6), 653–659 (1994)MATH Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput. Indus. Eng. 21(6), 653–659 (1994)MATH
13.
go back to reference Wang, J.B., Guo, Q.: A due-date assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 34(2), 303–309 (2010)MathSciNet Wang, J.B., Guo, Q.: A due-date assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 34(2), 303–309 (2010)MathSciNet
14.
go back to reference Yang, S.H., Wang, J.B.: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl. Math. Comput. 217(9), 4819–4826 (2011)MathSciNetMATH Yang, S.H., Wang, J.B.: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl. Math. Comput. 217(9), 4819–4826 (2011)MathSciNetMATH
15.
go back to reference Bai, J., Li, Z.R., Huang, X.: Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Modell. 36(3), 1267–1274 (2012)MathSciNetCrossRef Bai, J., Li, Z.R., Huang, X.: Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Modell. 36(3), 1267–1274 (2012)MathSciNetCrossRef
16.
go back to reference Wang, X.R., Wang, J.J.: Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl. Math. Modell. 37(4), 2388–2393 (2013)MathSciNetCrossRef Wang, X.R., Wang, J.J.: Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl. Math. Modell. 37(4), 2388–2393 (2013)MathSciNetCrossRef
17.
go back to reference Yue, Q., Wang, G.: Scheduling Deteriorating Jobs with Common Due Window Assignment. Indus. Eng. Manag. 20(6), 42–47 (2015) Yue, Q., Wang, G.: Scheduling Deteriorating Jobs with Common Due Window Assignment. Indus. Eng. Manag. 20(6), 42–47 (2015)
18.
go back to reference Azadeh, A., Habibnejad-Ledari, H., Zadeh, S.Abdolhossein, Farahani, M.Hosseinabadi: A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. Int. J. Comput. Int. Manufact. 30(2), 292–304 (2017)CrossRef Azadeh, A., Habibnejad-Ledari, H., Zadeh, S.Abdolhossein, Farahani, M.Hosseinabadi: A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. Int. J. Comput. Int. Manufact. 30(2), 292–304 (2017)CrossRef
19.
go back to reference Zhang, X., Liu, S.C., Yin, Y., Wu, J.B.C.C.: Single-machine scheduling problems with a learning effect matrix. Iran. J. Sci. Technol. Trans. A Sci. 42(3), 1327–1335 (2018)MathSciNetCrossRef Zhang, X., Liu, S.C., Yin, Y., Wu, J.B.C.C.: Single-machine scheduling problems with a learning effect matrix. Iran. J. Sci. Technol. Trans. A Sci. 42(3), 1327–1335 (2018)MathSciNetCrossRef
20.
go back to reference Wu, C.C., Bai, D., Chung, I.H., Cheng, S.R., Jhwueng, D.C., Lin, W.C., Said, L.B.: A branch-and-bound and four metaheuristics for minimising total completion time for a two-stage assembly flowshop scheduling problem with learning consideration. Eng. Optim. 52(6), 1009–1036 (2020)MathSciNetCrossRef Wu, C.C., Bai, D., Chung, I.H., Cheng, S.R., Jhwueng, D.C., Lin, W.C., Said, L.B.: A branch-and-bound and four metaheuristics for minimising total completion time for a two-stage assembly flowshop scheduling problem with learning consideration. Eng. Optim. 52(6), 1009–1036 (2020)MathSciNetCrossRef
21.
go back to reference Liang, X.X., Liu, M.Q., Feng, Y.B., Wang, J.B., Wen, L.S.: Solution algorithms for single machine resource allocation scheduling with deteriorating jobs and group technology. Eng. Optim. 52(7), 1184–1197 (2020)MathSciNetCrossRef Liang, X.X., Liu, M.Q., Feng, Y.B., Wang, J.B., Wen, L.S.: Solution algorithms for single machine resource allocation scheduling with deteriorating jobs and group technology. Eng. Optim. 52(7), 1184–1197 (2020)MathSciNetCrossRef
22.
go back to reference Wu, C.C., Zhang, X., Azzouz, A., Shen, W.L., Cheng, S.R., Hsu, P.H., Lin, W.C.: Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function. Eng. Optim. 53(5), 843–866 (2021)MathSciNetCrossRef Wu, C.C., Zhang, X., Azzouz, A., Shen, W.L., Cheng, S.R., Hsu, P.H., Lin, W.C.: Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function. Eng. Optim. 53(5), 843–866 (2021)MathSciNetCrossRef
23.
go back to reference Wu, C.C., Bai, D., Chen, J.H., Lin, W.C., Xing, L., Lin, J.C., Cheng, S.R.: Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. Swarm Evolut. Comput. 60, 100765 (2021)CrossRef Wu, C.C., Bai, D., Chen, J.H., Lin, W.C., Xing, L., Lin, J.C., Cheng, S.R.: Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. Swarm Evolut. Comput. 60, 100765 (2021)CrossRef
24.
go back to reference Koulamas, C., Kyparisis, G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Euro. J. Op. Res. 187, 1045–1049 (2008)MathSciNetCrossRef Koulamas, C., Kyparisis, G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Euro. J. Op. Res. 187, 1045–1049 (2008)MathSciNetCrossRef
25.
go back to reference Liu, M.: Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl. Math. Modell. 20(6), 42–47 (2013)MathSciNet Liu, M.: Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl. Math. Modell. 20(6), 42–47 (2013)MathSciNet
26.
go back to reference Yin, Y., Cheng, T.C.E., Xu, J., Cheng, S.R., Wu, C.C.: Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J. Indus. Manag. Optim. 9(2), 323–339 (2013)MathSciNetCrossRef Yin, Y., Cheng, T.C.E., Xu, J., Cheng, S.R., Wu, C.C.: Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J. Indus. Manag. Optim. 9(2), 323–339 (2013)MathSciNetCrossRef
27.
go back to reference Wu, Y.B., Wang, J.J.: Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput. Appl. 27, 937–943 (2016)CrossRef Wu, Y.B., Wang, J.J.: Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput. Appl. 27, 937–943 (2016)CrossRef
28.
go back to reference Maecker, S., Shen, L.: Solving parallel machine problems with delivery times and tardiness objectives. Annals Op. Res. 285(10), 315–334 (2020)MathSciNetCrossRef Maecker, S., Shen, L.: Solving parallel machine problems with delivery times and tardiness objectives. Annals Op. Res. 285(10), 315–334 (2020)MathSciNetCrossRef
29.
go back to reference Mönch, L., Shen, L.: Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. Comput. Op. Res. 127, 105126 (2021)MathSciNetCrossRef Mönch, L., Shen, L.: Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. Comput. Op. Res. 127, 105126 (2021)MathSciNetCrossRef
30.
go back to reference Graham, R. L., Lawler, E. L., Lenstra, J. K., Kan, A. R.: Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals Dis. Math. 5, 287–326 (1979) Graham, R. L., Lawler, E. L., Lenstra, J. K., Kan, A. R.: Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals Dis. Math. 5, 287–326 (1979)
Metadata
Title
The due date assignment scheduling problem with the deteriorating jobs and delivery time
Authors
Jin Qian
Haiyan Han
Publication date
03-08-2021
Publisher
Springer Berlin Heidelberg
Published in
Journal of Applied Mathematics and Computing / Issue 4/2022
Print ISSN: 1598-5865
Electronic ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-021-01607-9

Other articles of this Issue 4/2022

Journal of Applied Mathematics and Computing 4/2022 Go to the issue

Premium Partner