Skip to main content
Log in

Bicriterion scheduling with group technology and deterioration effect

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

Abstract

This paper studies a single-machine bicriterion scheduling in which both group setup times and job-processing times are deterioration (increasing) functions of their starting times. Two objectives are considered, i.e., the primary criterion is the total weighted completion time, the secondary criterion is the maximum cost. We show that this bicriterion group scheduling problem can be solved in polynomial time.

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

Access this article

Subscribe and save

Springer+ Basic
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Gawiejnowicz, S.: Time-dependent Scheduling. Springer, Berlin (2008)

    Book  MATH  Google Scholar 

  2. Wei, C.-M., Wang, J.-B.: Single machine quadratic penalty function scheduling with deteriorating jobs and group technology. Appl. Math. Model. 34, 3642–3647 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lu, Y.-Y., Wang, J.-J., Wang, J.-B.: Single machine group scheduling with decreasing time-dependent processing times subject to release dates. Appl. Math. Comput. 234, 286–292 (2014)

    MathSciNet  MATH  Google Scholar 

  4. Wang, J.-B., Wang, J.-J.: Single machine group scheduling with time dependent processing times and ready times. Inf. Sci. 275, 226–231 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Wang, J.-B., Wang, J.-J.: Single-machine scheduling problems with precedence constraints and simple linear deterioration. Appl. Math. Model. 39, 1172–1182 (2015)

    Article  MathSciNet  Google Scholar 

  6. Sun, L.-H., Cui, K., Chen, J.-H., Wang, J.: Due-date assignment and convex resource allocation scheduling with variable job processing times. Int. J. Prod. Res. 54, 3551–3560 (2016)

    Article  Google Scholar 

  7. Wang, J.-B., Liu, M., Yin, N., Ji, P.: Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. J. Ind. Manag. Optim. 13, 1025–1039 (2017)

    MathSciNet  MATH  Google Scholar 

  8. Wang, J.-J., Liu, Y.-J.: Single-machine bicriterion group scheduling with deteriorating setup times and job processing times. Appl. Math. Comput. 242, 309–314 (2014)

    MathSciNet  MATH  Google Scholar 

  9. Cheng, T.C.E., Kovalyov, M.Y., Tuzikov, A.: Single machine group scheduling with two ordered criteria. J. Oper. Res. Soc. 47, 315–320 (1996)

    Article  MATH  Google Scholar 

  10. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lawer, E.L.: Optimal sequencing of a single machine subject to precedence constraint. Manag. Sci. 19, 544–546 (1973)

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by the Foundation of Education Department of Liaoning (China) [L201753].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xue Huang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, X. Bicriterion scheduling with group technology and deterioration effect. J. Appl. Math. Comput. 60, 455–464 (2019). https://doi.org/10.1007/s12190-018-01222-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-018-01222-1

Keywords

Mathematics Subject Classification