Skip to main content
SpringerLink
Log in

Single machine group scheduling with time and position dependent processing times

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

Abstract

In the paper two resource constrained single-machine group scheduling problems with time and position dependent processing times are considered. By time and position dependent processing times and group technology assumption, we mean that the processing time of a job is defined by the function of its starting time and position in the group, and the group setup times of a group is a positive strictly decreasing continuous function of the amount of consumed resource. We present polynomial solutions for the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit, and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.

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. Bachman A., Cheng T.C.E., Janiak A., Ng C.T.: Scheduling start time dependent jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 53, 688–693 (2002)

    Article  MATH  Google Scholar 

  3. Bachman, A., Janiak, A.: Scheduling jobs with special type of start time dependent processing time. Technical Report 34/97, Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372 Wroclaw (1997)

  4. Bachman A., Janiak A.: Scheduling jobs with position dependent processing times. J. Oper. Res. Soc. 55, 257–264 (2004)

    Article  MATH  Google Scholar 

  5. Bachman, A., Janiak, A., Kovalyov, M.Y.: Complexity of single machine scheduling problems with processing times exponentially dependent on start times. In: Operations Research Proceedings SOR 2002. Springer, Berlin (2002)

  6. Bachman A., Janiak A., Kovalyov M.Y.: Minimizing the total weighted completion time of deteriorating jobs. Inf. Process. Lett. 81, 81–84 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Biskup D.:: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315–329 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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 

  9. Cheng T.C.E., Janiak A., Kovalyov M.Y.: Single machine batch scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 135, 177–183 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cheng T.C.E., Kovalyov M.Y., Janiak A., Ng C.T.: Group scheduling with controllable setup and processing times: minimizing total weighted completion time. Ann. Oper. Res. 133, 163–174 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chudzik K., Janiak A., Lichtenstein M.: Scheduling problems with resource allocation. Scheduling in computer and manufacturing systems, pp. 39–67. WKL, Warszawa (2006)

    Google Scholar 

  12. Chudzik K., Janiak A., Lichtenstein M.: Scheduling problems with setup considerations. Scheduling in computer and manufacturing systems, pp. 87–99. WKL, Warszawa (2006)

    Google Scholar 

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

    MATH  Google Scholar 

  14. 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. Discrete Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  15. Huang X., Wang M.-Z., Wang J.-B.: Single-machine group scheduling with both learning effects and deteriorating jobs. Comput. Ind. Eng. 60, 750–754 (2011)

    Article  Google Scholar 

  16. Iwanowski D., Janiak A.: Optimal resource allocation for single machine scheduling problems with time and resource dependent processing times. Syst. Sci. (Wroclaw) 28(2), 85–94 (2002)

    MathSciNet  Google Scholar 

  17. Janiak A., Krysiak T.: Single processor scheduling with job values depending on their completion times. J. Schedul. 10(2), 129–138 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Janiak A., Krysiak T.: Scheduling jobs with values dependent on their completion times. Int. J. Prod. Econ. 135(1), 231–241 (2012)

    Article  Google Scholar 

  19. Janiak A., Krysiak T., Pappis C.P., Voutsinas T.G.: A scheduling problem with job values given as a power function of their completion times. Eur. J. Oper. Res. 193(3), 836–848 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  20. Janiak, A., Lichtenstein, M.: Some single machine scheduling problems with resource dependent set-up and processing times. In: Operations Research Proceedings 2000. Selected Papers of the Symposium on Operations Research (OR 2000), Dresden, September 9–12, 2000, pp. 51–58. Springer, Berlin (2001)

  21. Kovalyov M.Y., Janiak A.: Single machine group scheduling with ordered criteria. Ann. Oper. Res. 57, 191–201 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kuo W.-H., Yang D.L.: Single-machine group scheduling with a time-dependent learning effect. Comput. Oper. Res. 33, 2099–2112 (2006)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. March J.: Footnotes to organizational change. Admin. Sci. Q. 26, 563–577 (1981)

    Article  Google Scholar 

  25. Mitrofanov S.P.: Scientific Principles of Group Technology. National Lending Library, London (1966)

    Google Scholar 

  26. Mukhopadhyay T., Singh P.V., Kim S.H.: Learning curves of agents with diverse skills in information technology-enabled physician referral systems. Inf. Syst. Res. 22, 586–605 (2011)

    Article  Google Scholar 

  27. Portmann M.C., Janiak A., Kovalyov M.Y.: Single machine group scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 162, 112–121 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  28. Potts C.N., Van Wassenhove L.N.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43, 395–406 (1992)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  30. Tuzikov, A., Janiak, A., Shafransky, Y.: Sequencing with ordered criteria, precedence and group technology constraints. Informatica 12, 61–88 (2001)

    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., Huang X., Wu Y.B., Ji P.: Group scheduling with independent setup times, ready times, and deteriorating job processing times. Int. J. Adv. Manuf. Technol. 60, 643–649 (2012)

    Article  Google Scholar 

  33. 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 

  34. Wang J.B., Xia Z.Q.: Scheduling jobs under decreasing linear deterioration. Inf. Process. Lett. 94(2), 63–69 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  35. Webster S., Baker K.R.: Scheduling groups of jobs on a single machine. Oper. Res. 43, 692–703 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  36. Wu C.C., Lee W.C.: Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int. J. Prod. Econ. 115, 128–133 (2008)

    Article  Google Scholar 

  37. Wu C.C., Shiau Y.R., Lee W.C.: Single-machine group scheduling problems with deterioration consideration. Comput. Oper. Res. 35, 1652–1659 (2008)

    Article  MATH  Google Scholar 

  38. Yan Y., Wang D.Z., Wang D.W., Wang H.F.: Single machine group scheduling problems with the effects of deterioration and learning. Acta Autom. Sin. 35, 1290–1295 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  39. Zhang X., Yan G., Huang W., Tang G.: Single-machine scheduling problems with time and position dependent processing times. Ann. Oper. Res. 186, 345–356 (2011)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Xue Huang

  2. School of Management Science and Engineering, Dalian University of Technology, Dalian, 116024, China

    Ming-Zheng Wang

Authors
  1. Xue Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming-Zheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xue Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X., Wang, MZ. Single machine group scheduling with time and position dependent processing times. Optim Lett 8, 1475–1485 (2014). https://doi.org/10.1007/s11590-012-0535-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0535-z

Keywords

Search

Navigation