Skip to main content
SpringerLink
Log in

Single-machine group scheduling with deteriorating jobs and allotted resource

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we consider single-machine scheduling problems with deteriorating jobs and resource allocation in a group technology environment. In the proposed model of this paper the actual processing time of a job depend on its starting time and the amount of resource allocated to it, and the actual setup time of a group depend on its starting time and the amount of resource allocated. Deterioration effect and two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost. For the linear resource allocation function and the convex resource allocation function, we show that the problem remains polynomially solvable under certain conditions.

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

  1. Alidaee, B., Womer, N.K.: Scheduling with time dependent processing processing times: review and extensions. J Oper Res Soc 50, 711–720 (1999)

    MATH  Google Scholar 

  2. Bai, J., Li, Z.-R., Huang, X.: Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Modell. 36, 1267–1274 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng, T.C.E., Janiak, A.: Resource optimal control in some single-machine scheduling problems. IEEE Trans. Automatic Control 39, 1243–1246 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng, T.C.E., Janiak, A.: A permutation flow-shop scheduling problem with convex models of operation processing times. Ann. Oper. Res. 96, 39–60 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Bicriterion single machine scheduling with resource dependent processing times. SIAM J. Optim. 8, 617–630 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cheng, T.C.E., Kovalyov, M.Y.: Single machine batch scheduling with deadlines and resource dependent processing times. Oper. Res. Lett. 17, 243–249 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gawiejnowicz, S.: Time-Dependent Scheduling. Springer, Berlin (2008)

    MATH  Google Scholar 

  9. Gorczyca, M., Janiak, A.: Resource level minimization in the discrete-continuous scheduling. Eur. J. Oper. Res. 203, 32–41 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gordon, V.S., Potts, C.N., Strusevich, V.A., Whitehead, J.D.: Single machine models with processing time deterioration: handling precedence constraints via priority generation. J. Schedul. 11, 357–370 (2008)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Janiak, A.: Single machine sequencing with linear models of release dates. Naval Res. Logistics 45, 99–113 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Janiak, A., Kovalyov, M.Y.: Single machine scheduling subject to deadlines and resource dependent processing times. Eur. J.Oper. Res. 94, 284–291 (1996)

    Article  MATH  Google Scholar 

  14. Kaspi, M., Shabtay, D.: Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput. Oper. Res. 31, 1481–1489 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kaspi, M., Shabtay, D.: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Comput. Oper. Res. 33, 3015–3033 (2006)

    Google Scholar 

  16. Koulamas, C., Gupta, S., Kyparisis, G.J.: A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. Eur. J. Oper. Res. 205, 479–482 (2010)

    Article  MATH  Google Scholar 

  17. Lee, W.-C., Wu, C.-C.: A note on single-machine group scheduling problems with position-based learning effect. Appl. Math. Modell. 33, 2159–2163 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lee, W.-C., Wu, C.-C.: A note on optimal policies for two group scheduling problems with deteriorating setup and processing times. Comput. Indus. Eng. 58, 646–650 (2010)

    Article  MathSciNet  Google Scholar 

  19. Lee, W.-C., Wu, C.-C., Wen, C.-C., Chung, Y.-H.: A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput. Indus. Eng. 54(4), 737–749 (2008)

    Article  Google Scholar 

  20. Lee, W.-C., Wu, C.-C., Chung, Y.-H., Liu, H.-C.: Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. Comput. Indus. Eng. 36, 2111–2121 (2009)

    MATH  Google Scholar 

  21. Leyvand, Y., Shabtay, D., Steiner, G.: A general approach to solve various due date assignment problems for a general type of resource consumption function. Eur. J. Oper. Res. 206, 301–312 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  23. Mosheiov, M.: Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21, 653–659 (1994)

    Article  MATH  Google Scholar 

  24. Nowicki, E., Zdrzalka, S.: A survey of results for sequencing problems with controllable processing times. Discret. Appl. Math. 26, 271–287 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  25. Pinedo, M.: Scheduling:Theory, Algorithms, and Systems. Upper Saddle River, Prentice-Hall NJ (2002)

    Google Scholar 

  26. Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Discret. Appl. Math. 155, 1643–1666 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  27. Shabtay, D., Steiner, G.: Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf. Serv. Oper. Manag. 9, 332–350 (2007)

    Google Scholar 

  28. Shabtay, D., Steiner, G.: tHE single machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann. Oper. Res. 159, 25–40 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wang, X., Cheng, T.C.E.: Single machine scheduling with resource dependent release times and processing times. Eur. J. Oper. Res. 162, 727–739 (2005)

    Article  MATH  Google Scholar 

  30. Wang, J.-B., Lin, L., Shan, F.: Single machine group scheduling problems with deteriorating jobs. Int. J. Adv. Manuf. Technol. 39, 808–812 (2008)

    Article  Google Scholar 

  31. Wang, J.-B., Gao, W.-J., Wang, L.-Y., Wang, D.: Single machine group scheduling with general linear deterioration to minimize the makespan. Int. J. Adv. Manuf. Technol. 43, 146–150 (2009)

    Article  Google Scholar 

  32. Wang, J.-B., Wang, J.-J., Ji, P.: Scheduling jobs with chain precedence constraints and deteriorating jobs. J. Oper. Res. Soc. 62, 1765–1770 (2011)

    Article  Google Scholar 

  33. Wang, J.-B., Wang, M.-Z.: Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Comput. Oper. Res. 39, 492–497 (2012a)

  34. Wang, J.-B., Wang, M.-Z.: Single-machine scheduling with nonlinear deterioration. Optim. Lett. 6, 87–98 (2012b)

    Google Scholar 

  35. Wang, J.-B., Wang, M.-Z., Ji, P.: Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. Int. J. Syst. Sci. 43, 861–868 (2012c)

  36. Wang, D., Wang, M.-Z., Wang, J.-B.: Single-machine scheduling with learning effect and resource-dependent processing times. Comput. Indus. Eng. 59, 458–462 (2010)

    Article  Google Scholar 

  37. Wang, J.-B., Xia, Z.-Q.: Single machine scheduling problems with controllable processing times and total absolute differences penalties. Eur. J. Oper. Res. 177, 638–645 (2007)

    Article  MATH  Google Scholar 

  38. Wei, C.-M., Wang, J.-B., Ji, P.: Single-machine scheduling with time-and-resource-dependent processing times. Appl. Math. Modell. 62, 792–798 (2012)

    Google Scholar 

  39. Yang, S.-J.: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Appl. Math. Modell. 35, 4008–4016 (2011)

    Article  MATH  Google Scholar 

  40. Yang, S.-J., Yang, D.-L.: Single-machine group scheduling problems under the effects of deterioration and learning. Comput. Indus. Eng. 58, 754–758 (2010)

    Article  Google Scholar 

  41. Yang, S.-J., Yang, D.-L.: Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption. Appl. Math. Modell. 35, 2068–2074 (2011)

    Article  MATH  Google Scholar 

  42. Zhang, X., Yan, G.: Single-machine group scheduling problems with deteriorated and learning effect. Appl. Math. Comput. 216, 1259–1266 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  43. Zhu, Z., Sun, L., Chu, F., Liu, M.: Single-machine group scheduling with resource allocation and learning effect. Comput. Indus. Eng. 60, 148–157 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

The authors are grateful for two anonymous referees for their helpful comments on earlier version of the article. The work described in this paper was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. e.g. PolyU 517011).

Author information

Authors and Affiliations

  1. School of Computer, Shenyang Aerospace University, Shenyang , 110136, China

    Dan Wang

  2. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China

    Yunzhang Huo & Ping Ji

Authors
  1. Dan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunzhang Huo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dan Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, D., Huo, Y. & Ji, P. Single-machine group scheduling with deteriorating jobs and allotted resource. Optim Lett 8, 591–605 (2014). https://doi.org/10.1007/s11590-012-0577-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0577-2

Keywords

Search

Navigation