Skip to main content
SpringerLink
Log in

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

In this paper, we study the scheduling of proportional-linearly deteriorating jobs with positional due indices, release dates, deadlines and precedence relations on a single machine. The scheduling criteria studied in this paper include the makespan, maximum lateness, maximum tardiness, maximum flow time, maximum weighted completion time, maximum scheduling cost, total completion time, and the number of tardy jobs. By applying Lawler’s rule and Smith’s rule, polynomially solvable problems are processed by using two unified methods. We also present some new NP-hardness results when processing times of the jobs have no deterioration. Our results generalize a series of known achievements in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin

    Book  Google Scholar 

  • Brauner N, Finke G, Shafransky Y, Sledneu D (2016) Lawler’s minmax cost algorithm: optimality conditions and uncertainty. J Sched 19:401–408

    Article  Google Scholar 

  • Brauner N, Finke G, Shafransky Y (2017) Lawler’s minmax cost problem under uncertainty. J Comb Optim 34:31–46

    Article  Google Scholar 

  • Chen QQ, Lin L, Tan ZY, Yan YJ (2017) Coordination mechanisms for scheduling games with proportional deterioration. Eur J Oper Res 263:380–389

    Article  Google Scholar 

  • Cheng YS, Sun SJ (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194:18–27

    Article  Google Scholar 

  • Debczynski M, Gawiejnowicz S (2013) Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion. Comput Ind Eng 64:273–279

    Article  Google Scholar 

  • Gao Y, Yuan JJ (2015) Pareto minimizing total completion time and maximum cost with positional due indices. J Oper Res Soc China 3:381–387

    Article  Google Scholar 

  • Gao Y, Yuan JJ (2017) Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discrete Optim 25:105–119

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  • Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472–478

    Article  Google Scholar 

  • Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin

    Book  Google Scholar 

  • Gawiejnowicz S, Kononov A (2014) Isomorphic scheduling problems. Ann Oper Res 213:131–145

    Article  Google Scholar 

  • Gawiejnowicz S, Kurc W, Pankowska L (2009a) Equivalent time-dependent scheduling problems. Eur J Oper Res 196:919–929

    Article  Google Scholar 

  • Gawiejnowicz S, Kurc W, Pankowska L (2009b) Conjugate problems in time-dependent scheduling. J Sched 12:543–553

    Article  Google Scholar 

  • Hall NG (1986) Scheduling problems with generalized due dates. IIE Trans 18:220–222

    Article  Google Scholar 

  • Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer, Boston, MA, pp 85–103

    Chapter  Google Scholar 

  • Kononov A (1998) Single machine scheduling problems with processing times proportional to an arbitrary function. Discrete Anal Oper Res 5:17–37 (in Russian)

    Google Scholar 

  • Lawler EL (1983) Scheduling a single machine to minimize the number of late jobs. Report No. UCB/CSD 83/139, Computer Science Division, University of California, Berkeley, USA

  • Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19:544–546

    Article  Google Scholar 

  • Lawler EL, Moore JM (1969) A functional equation and its applications to resource allocation and sequencing problems. Manag Sci 16:77–84

    Article  Google Scholar 

  • Lenstra JK, Rinnooy AHG, Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Oper Res 1:343–362

    Google Scholar 

  • Li YQ, Li G, Sun LY, Xu ZY (2009) Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. Int J Prod Econ 118:424–429

    Article  Google Scholar 

  • Li KL, Liu CB, Li KQ (2014) An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs. Theor Comput Sci 543:46–51

    Article  Google Scholar 

  • Liu P, Yi N, Zhou XY (2011) Two-agent single-machine scheduling problems under increasing linear deterioration. Appl Math Model 35:2290–2296

    Article  Google Scholar 

  • Ma R, Tao JP, Yuan JJ (2016) Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl Math Comput 273:570–583

    Google Scholar 

  • Melnikov OI, Shafransky YM (1979) Parametric problem in scheduling theory. Cybernetics 15:352–357

    Article  Google Scholar 

  • Miao CX (2018) Complexity of scheduling with proportional deterioration and release dates. Iran J Sci Technol Trans Sci 42:1337–1342

    Article  Google Scholar 

  • Miao CX, Zhang YZ, Wu CL (2012) Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. Theor Comput Sci 462:80–87

    Article  Google Scholar 

  • Moore JM (1968) An \(n\) job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15:102–109

    Article  Google Scholar 

  • Mosheiov G (1994) Scheduling deteriorating jobs under simple linear deterioration. Comput Oper Res 21:653–659

    Article  Google Scholar 

  • Ng CT, Li SS, Cheng TCE, Yuan JJ (2010) Preemptive scheduling with simple linear deterioration on a single machine. Theor Comput Sci 411:3578–3586

    Article  Google Scholar 

  • Qi XL, Zhou SG, Yuan JJ (2009) Single machine parallel-batch scheduling with deteriorating jobs. Theor Comput Sci 410:830–836

    Article  Google Scholar 

  • Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist 3:59–66

    Article  Google Scholar 

  • Strusevich V, Rustogi K (2017) Scheduling with times-changing effects and rate-modifying activities. Springer, Berlin

    Book  Google Scholar 

  • Wu CC, Cheng SR, Wu WH, Yin YQ, Wu WH (2013) The single-machine total tardiness problem with unequal release times and a linear deterioration. Appl Math Comput 219:10401–10415

    Google Scholar 

  • Yu S, Wong PWH (2013) Online scheduling of simple linear deteriorating jobs to minimize the total general completion time. Theor Comput Sci 487:95–102

    Article  Google Scholar 

  • Yuan JJ (2017) Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J Sched 20:211–218

    Article  Google Scholar 

  • Zhao QL, Yuan JJ (2017) Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs. Asia Pac J Oper Res 34:12, Article ID: 1750024

  • Zhao CL, Zhang QL, Tang HY (2003) Scheduling problems under linear deterioration. Acta Autom Sin 29:531–535

    Google Scholar 

  • Zhao QL, Lu LF, Yuan JJ (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR Q J Oper Res 14:261–280

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the associate editor and two anonymous referees for their constructive comments and helpful suggestions. This research was supported by NSFC (11671368, 11771406).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, Henan, People’s Republic of China

    Rubing Chen & Jinjiang Yuan

Authors
  1. Rubing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinjiang Yuan.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, R., Yuan, J. Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR-Q J Oper Res 18, 177–196 (2020). https://doi.org/10.1007/s10288-019-00410-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-019-00410-4

Keywords

Mathematics Subject Classification

Search

Navigation