[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Single machine group scheduling under decreasing linear deterioration

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Alidaee and N. K. Womer,Scheduling with time dependent processing processing times: review and extensions, Journal of the Operational Research Society50 (1999), 711–720.

    Article  MATH  Google Scholar 

  2. A. Bachman, T. C. E.Cheng, A. Janiak and C. T. Ng,Scheduling start time dependent jobs to minimize the total weighted completion time, Journal of the Operational Research Society53 (2002), 688–693.

    Article  MATH  Google Scholar 

  3. S. Browne and U. Yechiali,Scheduling deteriorating jobs on a single processor, Operations Research38 (1990), 495–498.

    MATH  Google Scholar 

  4. Z.-L. Chen,Parallel machine scheduling with time dependent processing times Discrete Applied Mathematics70 (1996), 81–94.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. C. E. Cheng, Q. Ding and B. M. T. Lin,A concise survey of scheduling with timedependent processing times, European Journal of Operational Research152 (2004), 1–13.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics5 (1979), 287–326.

    MATH  MathSciNet  Google Scholar 

  7. K. I.-J. Ho, J. Y.-T. Leung and W.-D. Wei,Complexity of scheduling tasks with timedependent execution times, Information Processing Letters48 (1993), 315–320.

    Article  MATH  MathSciNet  Google Scholar 

  8. Y. C. Hsieh and D. L. Bricker,Scheduling linearly deteriorating jobs on multiple machines, Computers and Industrial Engineering32 (1997), 727–734.

    Article  Google Scholar 

  9. A. Kononov and S. Gawiejnowicz,NP-hard cases in scheduling deteriorating jobs on dedicated machines, Journal of the Operational Research Society52 (2001), 708–717.

    Article  MATH  Google Scholar 

  10. G. Mosheiov,V-shaped policies for scheduling deteriorating jobs, Operations Research39 (1991), 979–991.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. Mosheiov,Scheduling jobs under simple linear deterioration, Computers and Operations Research21 (1994), 653–659.

    Article  MATH  Google Scholar 

  12. G. Mosheiov,Multi-machine scheduling with linear deterioration, INFOR36 (1998), 205–214.

    Google Scholar 

  13. G. Mosheiov,Complexity analysis of job-shop scheduling with deteriorating jobs, Discrete Applied Mathematics117 (2002), 195–209.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. T. Ng, T. C. E. Cheng, A. Bachman and A. Janiak,Three scheduling problems with deteriorating jobs to minimize the total completion time, Information Processing Letters81 (2002), 327–333.

    Article  MathSciNet  Google Scholar 

  15. C. N. Potts and L. N. Van Wassenhove,Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, Journal of the Operational Research Society43 (1992), 395–406.

    Article  MATH  Google Scholar 

  16. P. S. Sundararaghavan and A. S. Kunnathur,Single machine scheduling with start time dependent processing times: some solvable cases, European Journal of Operational Research78 (1994), 394–403.

    Article  MATH  Google Scholar 

  17. J.-B. Wang and Z.-Q. Xia,Scheduling jobs under decreasing linear deterioration, Information Processing Letters94 (2005), 63–69.

    Article  MathSciNet  Google Scholar 

  18. J.-B. Wang and Z.-Q. Xia,Flow shop scheduling problems with deteriorating jobs under dominating machines, Journal of the Operational Research Society57 (2006), 220–226.

    MATH  Google Scholar 

  19. J.-B. Wang,Flow shop scheduling problems with decreasing linear deterioration under dominant machines, Computers and Operations Research34(2007), 2043–2058.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Science, Shenyang Institute of Aeronautical Engineering, 110034, Shenyang, P. R. China

    Ji-bo Wang, Feng Shan, Bo Jiang & Li-Yan Wang

  2. Basic Department, the Chinese People’s Armed Police Forces Academy, 065000, Langfang, P. R. China

    Ai-Xia Guo

Authors
  1. Ji-bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ai-Xia Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bo Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Li-Yan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Jb., Guo, AX., Shan, F. et al. Single machine group scheduling under decreasing linear deterioration. J. Appl. Math. Comput. 24, 283–293 (2007). https://doi.org/10.1007/BF02832317

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02832317

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation